Discovering associations in high-dimensional data

Authors:
Geoffrey I. Webb
Affiliations:
Monash University, Clayton, VIC, Australia
Venue:
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Year:
2012

Citing 5
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
K-Optimal Rule Discovery

Data Mining and Knowledge Discovery
Discovering Significant Patterns

Machine Learning
Layered critical values: a powerful direct-adjustment approach to discovering significant patterns

Machine Learning
Self-sufficient itemsets: An approach to screening potentially interesting associations between items

ACM Transactions on Knowledge Discovery from Data (TKDD)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Association discovery is one of the most studied tasks in the field of data mining (Agrawal et al. 1993). It involves identifying items that occur together in data, and has numerous applications in manufacturing, commerce, administration and science. However, far more attention has been paid to how to discover associations than to what associations should be discovered. In this talk Geoff will provide a highly subjective tour of the field. He will • highlight shortcomings of the dominant frequent pattern paradigm; • illustrate benefits of the alternative top-k paradigm; and • present the self-sufficient itemsets approach to identifying potentially interesting associations as described in Webb & Zhang (2005), Webb (2007, 2008, 2010, 2011).