{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/29451"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/29451","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Mining sophisticated patterns for classification and correlation analysis","abstract":"Pattern mining has been a hot issue since it was first proposed for market basket analysis. Even though pattern mining is one of the oldest topic in data mining domain, there are still many ongoing challenges to overcome on this subject since the scale of the data size is getting bigger and the complexity of data structure is getting more complicated. This dissertation discusses several pattern mining tasks, challenges associated with them, and algorithm designs that overcome these challenges. Specifically, we design and implement techniques for (1) directly mining discriminative patterns from a numeric valued feature set of k-embedded edge subtrees given labeled training data, (2) mining top correlated patterns from transactional databases with low minimum support, and (3) mining flipping correlation patterns from transactional databases given item hierarchy. We evaluate our solutions by conducting comprehensive experiments on large-scale synthetic and real world datasets.","abstract_html":"Pattern mining has been a hot issue since it was first proposed for market basket analysis. Even though pattern mining is one of the oldest topic in data mining domain, there are still many ongoing challenges to overcome on this subject since the scale of the data size is getting bigger and the complexity of data structure is getting more complicated. This dissertation discusses several pattern mining tasks, challenges associated with them, and algorithm designs that overcome these challenges. Specifically, we design and implement techniques for (1) directly mining discriminative patterns from a numeric valued feature set of k-embedded edge subtrees given labeled training data, (2) mining top correlated patterns from transactional databases with low minimum support, and (3) mining flipping correlation patterns from transactional databases given item hierarchy. We evaluate our solutions by conducting comprehensive experiments on large-scale synthetic and real world datasets.","abstract_has_math":false,"creators":["Kim, Sangkyum"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Han, Jiawei","Zhai, ChengXiang","Chang, Kevin C-C.","Schatz, Bruce R."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-02-01T00:46:55Z","date_published":"2012-02-01T00:46:55Z","updated_at":"2026-07-22T22:25:27Z","subjects":["sophisticated pattern mining","k-embedded-edge subtree","discriminative pattern","correlated pattern","flipping correlation pattern"],"languages":["en"],"rights":["Copyright 2011 Sangkyum Kim"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/29451","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Han, Jiawei","Zhai, ChengXiang","Chang, Kevin C-C.","Schatz, Bruce R."]},{"key":"dc:creator","label":"Author","values":["Kim, Sangkyum"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-02-01T00:46:55Z","2014-02-01T11:00:27Z","2011-12"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["sophisticated pattern mining","k-embedded-edge subtree","discriminative pattern","correlated pattern","flipping correlation pattern"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2011 Sangkyum Kim"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/29451"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Pattern mining has been a hot issue since it was first proposed for market basket analysis. Even though pattern mining is one of the oldest topic in data mining domain, there are still many ongoing challenges to overcome on this subject since the scale of the data size is getting bigger and the complexity of data structure is getting more complicated. This dissertation discusses several pattern mining tasks, challenges associated with them, and algorithm designs that overcome these challenges. Specifically, we design and implement techniques for (1) directly mining discriminative patterns from a numeric valued feature set of k-embedded edge subtrees given labeled training data, (2) mining top correlated patterns from transactional databases with low minimum support, and (3) mining flipping correlation patterns from transactional databases given item hierarchy. We evaluate our solutions by conducting comprehensive experiments on large-scale synthetic and real world datasets.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-09-23T18:08:57Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Kim_Sangkyum.pdf: 1823074 bytes, checksum: 3c8fd019952139afc8b2d501a4e9a0b2 (MD5)","Made available in DSpace on 2012-02-01T00:46:55Z (GMT). No. of bitstreams: 2 Kim_Sangkyum.pdf: 1823074 bytes, checksum: 3c8fd019952139afc8b2d501a4e9a0b2 (MD5) license.txt: 4059 bytes, checksum: d6544e66b106387a13daa193851b34e5 (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2012-02-01T00:50:25Z Item is restricted until 2014-02-01T00:50:07Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2014-02-01T11:00:27Z Item was in collections: Graduate Theses and Dissertations at Illinois (ID: 204) Dissertations and Theses - Computer Science (ID: 587) No. of bitstreams: 3 Kim_Sangkyum.pdf.txt: 211029 bytes, checksum: cca8dd4c4a1517192075d615c2913802 (MD5) Kim_Sangkyum.pdf: 1823074 bytes, checksum: 3c8fd019952139afc8b2d501a4e9a0b2 (MD5) license.txt: 4059 bytes, checksum: d6544e66b106387a13daa193851b34e5 (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2014-02-01T11:00:27Z"]},{"key":"dc:title","label":"Title","values":["Mining sophisticated patterns for classification and correlation analysis"]}]}],"canonical_facts":{"dc:contributor":["Han, Jiawei","Zhai, ChengXiang","Chang, Kevin C-C.","Schatz, Bruce R."],"dc:creator":["Kim, Sangkyum"],"dc:date":["2012-02-01T00:46:55Z","2014-02-01T11:00:27Z","2011-12"],"dc:description":["Pattern mining has been a hot issue since it was first proposed for market basket analysis. Even though pattern mining is one of the oldest topic in data mining domain, there are still many ongoing challenges to overcome on this subject since the scale of the data size is getting bigger and the complexity of data structure is getting more complicated. This dissertation discusses several pattern mining tasks, challenges associated with them, and algorithm designs that overcome these challenges. Specifically, we design and implement techniques for (1) directly mining discriminative patterns from a numeric valued feature set of k-embedded edge subtrees given labeled training data, (2) mining top correlated patterns from transactional databases with low minimum support, and (3) mining flipping correlation patterns from transactional databases given item hierarchy. We evaluate our solutions by conducting comprehensive experiments on large-scale synthetic and real world datasets.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-09-23T18:08:57Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Kim_Sangkyum.pdf: 1823074 bytes, checksum: 3c8fd019952139afc8b2d501a4e9a0b2 (MD5)","Made available in DSpace on 2012-02-01T00:46:55Z (GMT). No. of bitstreams: 2 Kim_Sangkyum.pdf: 1823074 bytes, checksum: 3c8fd019952139afc8b2d501a4e9a0b2 (MD5) license.txt: 4059 bytes, checksum: d6544e66b106387a13daa193851b34e5 (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2012-02-01T00:50:25Z Item is restricted until 2014-02-01T00:50:07Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2014-02-01T11:00:27Z Item was in collections: Graduate Theses and Dissertations at Illinois (ID: 204) Dissertations and Theses - Computer Science (ID: 587) No. of bitstreams: 3 Kim_Sangkyum.pdf.txt: 211029 bytes, checksum: cca8dd4c4a1517192075d615c2913802 (MD5) Kim_Sangkyum.pdf: 1823074 bytes, checksum: 3c8fd019952139afc8b2d501a4e9a0b2 (MD5) license.txt: 4059 bytes, checksum: d6544e66b106387a13daa193851b34e5 (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2014-02-01T11:00:27Z"],"dc:identifier":["http://hdl.handle.net/2142/29451"],"dc:language":["en"],"dc:rights":["Copyright 2011 Sangkyum Kim"],"dc:subject":["sophisticated pattern mining","k-embedded-edge subtree","discriminative pattern","correlated pattern","flipping correlation pattern"],"dc:title":["Mining sophisticated patterns for classification and correlation analysis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:27Z"}