{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81639"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81639","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Optimization Problems in Data Mining","abstract":"\"We introduce a novel type of rule, wherein claims of the form \"\"our object ranked r or better in x of the last t time units,\"\" are formalized, and where maximal claims of this form are defined under two natural partial orders. For the first, we give an efficient and optimal algorithm for finding all such claims. For the second, we give an algorithm whose running time is significantly more efficient than that of a naive one. Finally, we connect this boasting problem to that of finding a sequence of optimized confidence association rules, and give an efficient algorithm for solving a simplification of the problem.\"","abstract_html":""We introduce a novel type of rule, wherein claims of the form ""our object ranked r or better in x of the last t time units,"" are formalized, and where maximal claims of this form are defined under two natural partial orders. For the first, we give an efficient and optimal algorithm for finding all such claims. For the second, we give an algorithm whose running time is significantly more efficient than that of a naive one. Finally, we connect this boasting problem to that of finding a sequence of optimized confidence association rules, and give an efficient algorithm for solving a simplification of the problem."","abstract_has_math":false,"creators":["Heeren, Cinda"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Leonard B. Pitt"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:38Z","date_published":"2015-09-25T20:19:38Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3130932"],"render_values":[{"text":"(MiAaPQ)AAI3130932","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81639","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Leonard B. Pitt"]},{"key":"dc:creator","label":"Author","values":["Heeren, Cinda"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:38Z","10000-01-01","2004"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"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":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81639","(MiAaPQ)AAI3130932"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["\"We introduce a novel type of rule, wherein claims of the form \"\"our object ranked r or better in x of the last t time units,\"\" are formalized, and where maximal claims of this form are defined under two natural partial orders. For the first, we give an efficient and optimal algorithm for finding all such claims. For the second, we give an algorithm whose running time is significantly more efficient than that of a naive one. Finally, we connect this boasting problem to that of finding a sequence of optimized confidence association rules, and give an efficient algorithm for solving a simplification of the problem.\"","Made available in DSpace on 2015-09-25T20:19:38Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3130932.pdf: 2690346 bytes, checksum: 219f2116cf924571316de3530d3825fd (MD5) Previous issue date: 2004","Embargo set by: Seth Robbins for item 82920 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","93 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004."]},{"key":"dc:title","label":"Title","values":["Optimization Problems in Data Mining"]}]}],"canonical_facts":{"dc:contributor":["Leonard B. Pitt"],"dc:creator":["Heeren, Cinda"],"dc:date":["2015-09-25T20:19:38Z","10000-01-01","2004"],"dc:description":["\"We introduce a novel type of rule, wherein claims of the form \"\"our object ranked r or better in x of the last t time units,\"\" are formalized, and where maximal claims of this form are defined under two natural partial orders. For the first, we give an efficient and optimal algorithm for finding all such claims. For the second, we give an algorithm whose running time is significantly more efficient than that of a naive one. Finally, we connect this boasting problem to that of finding a sequence of optimized confidence association rules, and give an efficient algorithm for solving a simplification of the problem.\"","Made available in DSpace on 2015-09-25T20:19:38Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3130932.pdf: 2690346 bytes, checksum: 219f2116cf924571316de3530d3825fd (MD5) Previous issue date: 2004","Embargo set by: Seth Robbins for item 82920 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","93 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004."],"dc:identifier":["http://hdl.handle.net/2142/81639","(MiAaPQ)AAI3130932"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Optimization Problems in Data Mining"],"dc:type":["text"],"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:26:16Z"}