Files in this item



application/pdf3130932.pdf (3MB)Restricted to U of Illinois
(no description provided)PDF


Title:Optimization Problems in Data Mining
Author(s):Heeren, Cinda
Doctoral Committee Chair(s):Leonard B. Pitt
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Computer Science
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.
Issue Date:2004
Description:93 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004.
Other Identifier(s):(MiAaPQ)AAI3130932
Date Available in IDEALS:2015-09-25
Date Deposited:2004

This item appears in the following Collection(s)

Item Statistics