CCMine: Efficient mining of confidence-closed correlated patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3056, Issue , 2004, Pages 569-579

  Kim, Won Young ^a   Lee, Young Koo ^a   Han, Jiawei ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; CORRELATION METHODS; INFORMATION RETRIEVAL; PATTERN RECOGNITION;

ASSOCIATION MINING; CLOSED PATTERN; CORRELATED PATTERN MINING; DATA OBJECTS; INFORMATION LOSS; PERFORMANCE STUDY; SIMPLE METHOD;

DATA MINING;

CORRELATED PATTERNS; DATA OBJECTS; PATTERN MINING;

EID: 7444228742     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24775-3_68     Document Type: Conference Paper

References (15)

1. C. C. Aggarwal and P. S. Yu. A new framework for itemset generation. In Proc. 1998 ACM Symp. Principles of Database Systems (PODS’98), pages 18–24, Seattle, WA, June 1999
2. S. Brin, R. Motwani, and C. Silverstein. Beyond market basket: Generalizing association rules to correlations. In Proc. 1997 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’97), pages 265–276, Tucson, Arizona, May 1997.
3. S. Morishita and J. Sese. Traversing itemset lattice with statistical metric pruning. In Proc. 2000 ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS’00), pages 226–236, Dallas, TX, May 2001.
4. P.-N. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In Proc. 2002 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD’02), pages 32–41, Edmonton, Canada, July 2002.
5. E. Omiecinski. Alternative interest measures for mining associations. IEEE Trans. Knowledge and Data Engineering, 15:57–69, 2003.
6. Y.-K. Lee, W.-Y. Kim, D. Cai, and J. Han. CoMine: Efficient Mining of Correlated Patterns. In Proc. 2003 Int. Conf. Data Mining (ICDM’03), pages 581–584, Melbourne, FL, Nov. 2003.
7. S. Ma and J. L. Hellerstein. Mining mutually dependent patterns. In Proc. 2001 Int. Conf. Data Mining (ICDM’01), pages 409–416, San Jose, CA, Nov. 2001.
8. H. Xiong, P.-N. Tan, and V. Kumar. Mining Strong Affinity Association Patterns in Data Sets with Skewed Support Distribution. In Proc. 2003 Int. Conf. Data Mining (ICDM’03), pages 387–394, Melbourne, FL, Nov. 2003.
9. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. 7th Int. Conf. Database Theory (ICDT’99), pages 398–416, Jerusalem, Israel, Jan. 1999.
10. R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’98), pages 85–93, Seattle, WA, June 1998.
11. J. Pei, G. Dong, W. Zou, and J. Han. On computing condensed frequent pattern bases. In Proc. 2002 Int. Conf. on Data Mining (ICDM’02), pages 378–385, Maebashi, Japan, Dec. 2002.
12. M. Zaki. Generating Non-redundant Association Rules. In Proc. 2000 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD’00), Aug. 2000.
13. J. Wang, J. Han, and J. Pei. Closet+: Searching for the best strategies for mining frequent closed itemsets. In Proc. 2003 ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD’03), Washington, D.C., Aug. 2003.
14. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’00), pages 1–12, Dallas, TX, May 2000.
15. M. Zaki and C. Hsiao. CHARM: An Efficient Algorithm for Closed Itemset Mining, In Proc. SDM’02, Apr. 2002.