Re-examination of interestingness measures in pattern mining: A unified framework

Data Mining and Knowledge Discovery

Volumn 21, Issue 3, 2010, Pages 371-397

  Wu, Tianyi ^a   Chen, Yuguo ^b   Han, Jiawei ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Association rules; Frequent pattern; Generalized mean; Interestingness measure; Null invariant measure

Indexed keywords

CORRELATION PATTERNS; CRITICAL PROPERTIES; DATA SETS; EFFICIENT COMPUTATION; EXPERIMENTAL EVALUATION; FREQUENT PATTERNS; GENERALIZED MEAN; INTERESTINGNESS MEASURES; INVARIANT MEASURE; LARGE DATASETS; ORDER OF MAGNITUDE; PATTERN MINING; STATE-OF-THE-ART ALGORITHMS; TOTAL ORDERING; UNIFIED FRAMEWORK;

ASSOCIATIVE PROCESSING; COMPUTATIONAL EFFICIENCY;

ASSOCIATION RULES;

EID: 77956212881     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-009-0161-2     Document Type: Article

References (18)

1. Agrawal R, Srikant R (1994, Sept) Fast algorithms for mining association rules. In: Proceedings of 1994 international conference on very large data bases (VLDB'94), Santiago, Chile, pp 487-499
2. Bradshaw J (2001) YAMS-Yet another measure of similarity. EuroMUG, http://www.daylight.com/ meetings/emug01/bradshaw/similarity/YAMS.html
3. Brin S, Motwani R, Silverstein C (1997, May) Beyond market basket: generalizing association rules to correlations. In: Proceedings of 1997 ACM-SIGMOD international conference on management of data (SIGMOD'97), Tucson, AZ, pp 265-276
4. Brin S, Motwani R, Ullman JD, Tsur S (1997, May) Dynamic itemset counting and implication rules for market basket analysis. In: Proceedings of 1997 ACM-SIGMOD international conference on management of data (SIGMOD'97), Tucson, AZ, pp 255-264
5. Grahne G, Lakshmanan L,Wang X (2000, Feb) Efficientmining of constrained correlated sets. In: Proceedings of 2000 international conference on data engineering (ICDE'00), San Diego, CA, pp 512-521
6. Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15:55-86
7. Han J, Pei J, Yin Y (2000, May) Mining frequent patterns without candidate generation. In: Proceedings of 2000 ACM-SIGMOD international conference on management of data (SIGMOD'00), Dallas, TX, pp 1-12
8. He B, Chang KC-C, Han J (2004, Aug) Discovering complex matchings across web query interfaces: A correlation mining approach. In: Proceedings of 2004 ACM SIGKDD international conference on knowledge discovery in databases (KDD'04), Seattle, WA, pp 148-157
9. Hilderman RJ, Hamilton HJ (2001) Knowledge discovery and measures of interest. Kluwer Academic, Dordrecht
10. Kachigan S (1991) Multivariate statistical analysis: A conceptual introduction. Radius Press, New York
11. Kulczynski S (1927) Die pflanzenassoziationen der pieninen. In: Bulletin International de l'Académie Polonaise des Sciences et des Lettres, pp 57-203
12. Lee Y-K, Kim W-Y, Cai YD, Han J (2003, Nov) CoMine: efficient mining of correlated patterns. In: Proceedings of 2003 international conference on data mining (ICDM'03), Melbourne, FL, pp 581-584
13. Omiecinski E (2003) Alternative interest measures for mining associations. IEEE Trans Knowl Data Eng 15:57-69
14. Polya G, Harold HG, Littlewood JE (1988) Inequalities. Cambridge University Press, Cambridge
15. Savasere A, Omiecinski E, Navathe S (1998, Feb) Mining for strong negative associations in a large database of customer transactions. In: Proceedings of 1998 international conference on data engineering (ICDE'98), Orlando, FL, pp 494-502
16. Tan P-N, Kumar V, Srivastava J (2002, July) Selecting the right interestingness measure for association patterns. In: Proceedings of 2002 ACM SIGKDD international conference on knowledge discovery in databases (KDD'02), Edmonton, Canada, pp 32-41
17. Wu T, Chen Y, Han J (2007, Sept) Association mining in large databases: A re-examination of its measures. In: Proceedings of 2007 international conference on principles and practice of knowledge discovery in databases (PKDD'07), Warsaw, Poland, pp 621-628
18. Xiong H, Shekhar S, Tan P-N, Kumar V (2004, Aug) Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pairs. In: Proceedings of 2004 ACM SIGKDD international conference on knowledge discovery in databases (KDD'04), Seattle, WA, pp 334-343