Discovery of maximum length frequent itemsets

Information Sciences

Volumn 178, Issue 1, 2008, Pages 69-87

  Hu, Tianming ^a   Sung, Sam Yuan ^b   Xiong, Hui ^c   Fu, Qian ^d  

^a EAST CHINA NORMAL UNIVERSITY   (China)

^b South Texas College   (United States)

^c Rutgers University   (United States)

^d NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Association analysis; Data mining; FP tree; Frequent itemsets; Maximum length frequent itemsets

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

ASSOCIATION ANALYSIS; FP-TREE; FREQUENT ITEMSETS; MAXIMUM LENGTH FREQUENT ITEMSETS;

DATA MINING;

EID: 34948870441     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.08.006     Document Type: Article

References (25)

1. R.C. Agarwal, C.C. Aggarwal, V.V.V. Prasad, Depth first generation of long patterns, in: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2000, pp. 108-118.
2. R. Agrawal, T. Imielinski, A.N. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the ACM SIGMOD Conference on Management of Data, pages, 1993, pp. 207-216.
3. R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: Proceedings of the 20th International Conference on Vary Large Data Bases, 1994, pp. 487-499.
4. R.J. Bayardo, Efficiently mining long patterns from databases, in: Proceedings of ACM SIGMOD International Conference on Management of Data, 1998, pp. 85-93.
5. F. Beil, M. Ester, X. Xu, Frequent term-based text clustering, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002, pp. 436-442.
6. D. Burdick, M. Calimlim, J. Gehrke, MAFIA: A maximal frequent itemset algorithm for transaction databases, in: Proceedings of the 17th International Conference on Data Engineering, 2001, pp. 443-452.
7. W. Cheung, O.R. Zaiane, Incremental mining of frequent patterns without candidate generation or support constraint, in: Proceedings of the 7th International Database Engineering and Applications Symposium, 2003, pp. 111-116.
8. B.C.M. Fung, K. Wang, M. Ester, Large hierarchical document clustering using frequent itemsets, in: Proceedings of the Third SIAM International Conference on Data Mining, 2003.
9. K. Gouda, M.J. Zaki, Efficiently mining maximal frequent itemsets, in: Proceedings of the First IEEE International Conference on Data Mining, 2001, pp. 163-170.
10. G. Grahne, J. Zhu, High performance mining of maximal frequent itemsets, in: Proceedings of the Sixth SIAM International Workshop on High Performance Data Mining, pages, 2003, pp. 135-143.
11. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000, pp. 1-12.
12. Hipp J., Guntzer U., and Nakaeizadeh G. Algorithms for association rule mining - a general survey and comparison. SIGKDD Explorations 2 1 (2000) 58-64
13. Li Y., Zhu S., Wang X.S., and Jajodia S. Looking into the seeds of time: Discovering temporal patterns in large transaction sets. Information Sciences 176 8 (2006) 1003-1031
14. D. Lin, Z.M. Kedem, Pincer-search: a new algorithm for discovering the maximum frequent itemset, in: Proceedings of the Sixth International Conference on Extending Database Technology, 1998, pp. 105-119.
15. D.J. Newman, S. Hettich, C.L. Blake, C.J. Merz, UCI repository of machine learning databases. http://www.ics.uci.edu/~mlearn/MLRepository.html, 1998.
16. J. Pei, J. Han, R. Mao, CLOSET: an efficient algorithm for mining frequent closed itemsets, in: Proceedings of the Fifth ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000, pp. 21-30.
17. P. Shenoy, J.R. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, D. Shah, Turbo-charging vertical mining of large databases, in: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000, pp. 22-33.
18. R. Srikant, R. Agrawal, Mining sequential patterns: generalizations and performance improvements, in: Proceedings of the Fifth International Conference on Extending Database Technology, 1996, pp. 3-17.
19. M. Wojciechowski, M. Zakrzewicz, Dataset filtering techniques in constraint-based frequent pattern mining, in: Proceedings of ESF Exploratory Workshop on Pattern Detection and Discovery, 2002, pp. 77-91.
20. H. Xiong, P.-N. Tan, V. Kumar, Mining strong affinity association patterns in data sets with skewed support distribution, in: Proceedings of the Third IEEE International Conference on Data Mining, 2003, pp. 387-394.
21. Xiong H., Tan P.-N., and Kumar V. Hyperclique pattern discovery. Data Mining and Knowledge Discovery Journal 13 2 (2006) 219-242
22. Yu J.X., Chong Z., Lu H., Zhang Z., and Zhou A. A false negative approach to mining frequent itemsets from high speed transactional data streams. Information Sciences 176 14 (2006) 1986-2015
23. Zaki M.J. SPADE: an efficient algorithm for mining frequent sequences. Machine Learning 42 1/2 (2001) 31-60
24. M.J. Zaki, K. Gouda, Fast vertical mining using diffsets. Technical Report 01-1, Compuer Science Department, Rensselaer Polytechnic Institute, 2001.
25. M.J. Zaki, C.-J. Hsiao, CHARM: an efficient algorithm for closed itemset mining, in: Proceedings of the Second SIAM International Conference on Data Mining, 2002, pp. 12-28.