2026-09-19T03:49:01Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81639 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Leonard B. Pitt Heeren, Cinda 2015-09-25T20:19:38Z 2015-09-25T20:19:38Z 10000-01-01 2004 2004 "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. http://hdl.handle.net/2142/81639 (MiAaPQ)AAI3130932 eng Computer Science Optimization Problems in Data Mining text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.