Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

We wish you a happy and safe holiday season and all the best for 2025


Discovering Associations in High-Dimensional Data

Webb, G.I.

    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).
Cite as: Webb, G.I. (2012). Discovering Associations in High-Dimensional Data. In Proc. Australasian Database Conference (ADC 2012) Melbourne, Australia. CRPIT, 124. Zhang, R. and Zhang, Y. Eds., ACS. 7
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS