Alternative interest measures for mining associations in databases
Top Cited Papers
- 14 January 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 15 (1) , 57-69
- https://doi.org/10.1109/tkde.2003.1161582
Abstract
Data mining is defined as the process of discovering significant and potentially useful patterns in large volumes of data. Discovering associations between items in a large database is one such data mining activity. In finding associations, support is used as an indicator as to whether an association is interesting. In this paper, we discuss three alternative interest measures for associations: any-confidence, all-confidence, and bond. We prove that the important downward closure property applies to both all-confidence and bond. We show that downward closure does not hold for any-confidence. We also prove that, if associations have a minimum all-confidence or minimum bond, then those associations will have a given lower bound on their minimum support and the rules produced from those associations will have a given lower bound on their minimum confidence as well. However, associations that have that minimum support (and likewise their rules that have minimum confidence) may not satisfy the minimum all-confidence or minimum bond constraint. We describe the algorithms that efficiently find all associations with a minimum all-confidence or minimum bond and present some experimental results.Keywords
This publication has 16 references indexed in Scilit:
- Online generation of association rulesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Mining frequent patterns without candidate generationPublished by Association for Computing Machinery (ACM) ,2000
- Mining the most interesting rulesPublished by Association for Computing Machinery (ACM) ,1999
- Optimization of constrained frequent set queries with 2-variable constraintsPublished by Association for Computing Machinery (ACM) ,1999
- Exploratory mining and pruning optimizations of constrained associations rulesPublished by Association for Computing Machinery (ACM) ,1998
- Mining generalized association rulesFuture Generation Computer Systems, 1997
- Scalable parallel data mining for association rulesPublished by Association for Computing Machinery (ACM) ,1997
- Parallel mining of association rulesIEEE Transactions on Knowledge and Data Engineering, 1996
- Set-oriented mining for association rules in relational databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1995
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993