TFP: An efficient algorithm for mining top-k frequent closed itemsets

IEEE Transactions on Knowledge and Data Engineering

Volumn 17, Issue 5, 2005, Pages 652-664

  Wang, Jianyong ^a   Han, Jiawei ^b   Lu, Ying ^b   Tzvetkov, Petre ^b  

^a TSINGHUA UNIVERSITY   (China)

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

Author keywords

Association rules; Data mining; Frequent itemset; Mining methods and algorithms

Indexed keywords

ASSOCIATION RULES; FREQUENT ITEMSETS; MINING METHODS AND ALGORITHMS; TFP;

ALGORITHMS; CONSTRAINT THEORY; DATABASE SYSTEMS; KNOWLEDGE BASED SYSTEMS; LINEAR SYSTEMS; PROBLEM SOLVING;

DATA MINING;

EID: 19944376126     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2005.81     Document Type: Article

References (27)

1. R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. 1994 Int'l Conf. Very Large Data Bases (VLDB '94), pp. 487-499, Sept. 1994.
2. R. Agrawal and R. Srikant, "Mining Sequential Patterns," Proc. 1995 Int'l Conf. Data Eng. (ICDE '95), pp. 3-14, Mar. 1995.
3. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal, "Mining Frequent Patterns with Counting Inference," SIGKDD Explorations, pp. 66-75, vol. 2, 2000.
4. S.D. Bay and M.J. Pazzani, "Detecting Change in Categorical Data: Mining Contrast Sets," Proc. 1999 Int'l Conf. Knowledge Discovery and Data Mining (KDD '99), pp. 302-306, Aug. 1999.
5. R.J. Bayardo, "Efficiently Mining Long Patterns from Databases," Proc. 1998 ACM-SIGMOD Int'l Conf. Management of Data (SIGMOD '98), pp. 85-93, June 1998.
6. F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi, "Exante: Anticipated Data Reduction in Constrained Pattern Mining," Proc. Seventh European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD '03), Sept. 2003.
7. J.-F. Boulicaut and A. Bykowski, "Frequent Closures As a Concise Representation for Binary Data Mining," Proc. 2000 Pacific-Asia Conf. Knowledge Discovery and Data Mining (PAKDD '00), pp. 62-73, Apr. 2000.
8. J.-F. Boulicaut, A. Bykowski, and C. Rigotti, "Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries," Data Mining and Knowledge Discovery, vol. 7, pp. 5-22, 2003.
9. S. Brin, R. Motwani, and C. Silverstein, "Beyond Market Basket: Generalizing Association Rules to Correlations," Proc. 1997 ACM-SIGMOD Int'l Conf. Management of Data (SIGMOD '97), pp. 265-276, May 1997.
10. D. Burdick, M. Calimlim, and J. Gehrke, "MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases," Proc. 2001 Int'l Conf. Data Eng. (ICDE '01), pp. 443-452, Apr. 2001.
11. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J.D. Ullman, and C. Yang, "Finding Interesting Associations without Support Pruning"Proc. 2000 Int'l Conf. Data Eng. (ICDE '00), pp. 489-499, Feb. 2000.
12. A.W.-C. Fu, R.W.-W. Kwong, and J. Tang, "Mining n-Most Interesting Itemsets," Proc. 2000 Int'l Symp. Methodologies for Intelligent Systems (ISMIS '00), pp. 59-67, Oct. 2000.
13. J. Han and Y. Fu, "Discovery of Multiple-Level Association Rules from Large Databases," Proc. 1995 Int'l Conf. Very Large Data Bases (VLDE '95), pp. 420-431, Sept. 1995.
14. J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation," Proc. 2000 ACM-SIGMOD Int'l Conf. Management of Data (SIGMOD '00), pp. 1-12, May 2000.
15. C. Hidber, "Online Association Rule Mining," Proc. 2999 ACM-SIGMOD Int'l Conf. Management of Data (SIGMOD '99), pp. 145-156, June 1999.
16. Y.-K. Lee, W.-Y. Kim, Y.D. Cai, and J. Han, "CoMine: Efficient Mining of Correlated Patterns," Proc. 2003 Int'l Conf. Data Mining (ICDM '03), Nov. 2003.
17. G. Liu, H. Lu, W. Lou, and J.X. Yu, "On Computing, Storing, and Querying Frequent Patterns," Proc. 2003 ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '03), Aug. 2003.
18. S. Morishita and A. Nakaya, "Parallel Branch-and-Bound Graph Search for Correlated Association Rules," Large-Scale Parallel Data Mining, pp. 127-144, 1999.
19. S. Morishita and J. Sese, "Traversing Itemset Lattice with Statistical Metric Pruning," Proc. 2000 ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS '00), pp. 226-236, May 2001.
20. R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang, "Exploratory Mining and Pruning Optimizations of Constrained Associations Rules," Proc. 1998 ACM-SIGMOD Int'l Conf. Management of Data (SIGMOD '98), pp. 13-24, June 1998.
21. F. Pan, G. Cong, A.K.H. Tung, J. Yang, and M. Zaki, "CARPENTER: Finding Closed Patterns in Long Biological Datasets," Proc. 2003 ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '03), Aug. 2003.
22. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Discovering Frequent Closed Itemsets for Association Rules," Proc. Seventh Int'l Conf. Database Theory (ICDT '99), pp. 398-416, Jan. 1999.
23. J. Pei, J. Han, and R. Mao, "CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets," Proc. 2000 ACM-SIGMOD Int'l Workshop Data Mining and Knowledge Discovery (DMKD '00), pp. 11-20, May 2000.
24. F. Rioult, J.-F. Boulicaut, B. Cremileux, and J. Besson, "Using Transposition for Pattern Discovery from Microarray Data," Proc. Eighth ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery, June 2003.
25. J. Wang, J. Han, and J. Pei, "CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets," Proc. 2003 ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '03), pp. 236-245, Aug. 2003.
26. K. Wang, Y. He, D. Cheung, and F. Chin, "Mining Confident Rules without Support Requirement," Proc. 2001 ACM CIKM Int'l Conf. Information and Knowledge Management (CIKM '01), pp. 81-88, Nov. 2001.
27. M.J. Zaki and C.J. Hsiao, "CHARM: An Efficient Algorithm for Closed Itemset Mining," Proc. 2002 SIAM Int'l Conf. Data Mining (SDM '02), pp. 457-473, Apr. 2002.