Date and time:
Venue: 10.08.04 (Building 10, Level 8, Room 4)
Chair: Xiaodong Li
Abstract:
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In most real-world applications several models will equally optimize this function. However, they may not all equally satisfy a user's preferences which will be affected by background knowledge and pragmatic considerations that are infeasible to quantify into an objective function. Thus, the program may make arbitrary and potentially suboptimal decisions. In contrast, methods for exploratory pattern discovery, of which association rule discovery is the best known example, seek all models that satisfy user-defined criteria. This allows the user to select between these models, rather than relinquishing control to the program. K-optimal pattern discovery is an exploratory technique that finds the k patterns that optimize a user-selected objective function while respecting other user-specified constraints. I discuss some important Features that distinguish this approach from the minimum-support technique that underlies association-rule discovery and I describe efficient algorithms that support it.
About the speaker:
Geoff Webb holds a research chair in the Faculty of
Information Technology at
Seminar Organisation
Seminars are free and open to the general public. No booking is necessary. If you are interested in giving a presentation in this seminar series, or to make suggestions for speakers, please contact Xiaodong Li, the seminar co-ordinator.