Efficient single-pass frequent pattern mining using a prefix-tree

Information Sciences

Volumn 179, Issue 5, 2009, Pages 559-583

  Tanbeer, Syed Khairuzzaman ^a   Ahmed, Chowdhury Farhan ^a   Jeong, Byeong Soo ^a   Lee, Young Koo ^a  

^a Kyung Hee University   (South Korea)

Author keywords

Association rule; Data mining; Frequent pattern; Incremental mining; Interactive mining

Indexed keywords

ASSOCIATION RULES; ASSOCIATIVE PROCESSING; DATA MINING; DATA PROCESSING; DATABASE SYSTEMS; GROWTH (MATERIALS); INFORMATION MANAGEMENT; MINING; TERMINOLOGY;

APRIORI; CANDIDATE GENERATIONS; DATA STREAM PROCESSING; DATABASE INFORMATIONS; DATABASE SCANS; DYNAMIC TREES; FREQUENT PATTERN; FREQUENT PATTERN MININGS; GROWTH ALGORITHMS; GROWTH METHODS; INCREMENTAL MINING; INTERACTIVE MINING; PATTERN TREES; SORTING METHODS; TREE BRANCHES; TREE STRUCTURES;

TREES (MATHEMATICS);

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

References (34)

1. R.C. Agarwal, C.C. Aggarwal, V.V.V. Prasad, Depth first generation of long patterns, in: Proceedings of the Sixth ACM SIGKDD Conference, 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, 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. Blake C.L., and Merz C.J. UCI Repository of Machine Learning Databases (1998), University of California - Irvine, Irvine, CA
5. T. Brijs, G. Swinnen, K. Vanhoof, G. Wets, Using association rules for product assortment decisions: a case study, in: Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining, San Diego (USA), 1999, pp. 254-260.
6. C.H. Chang, S.H. Yang, Enhancing SWF for incremental association mining by itemset maintenance, in: Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2003.
7. Chen E., Cao H., Li Q., and Qian T. Efficient strategies for tough aggregate constraint-based sequential pattern mining. Information Sciences 178 (2008) 1498-1518
8. Chen G., and Wei Q. Fuzzy association rules and the extended mining algorithms. Information Sciences 147 1-4 (2002) 201-228
9. D.W. Cheung, S.D. Lee, B. Kao, A general incremental technique for maintaining discovered association rules, in: Proceedings of the Fifth International Conference on Database Systems for Advanced Applications, 1997, pp. 185-194.
10. W. Cheung, O.R. Zaïane, Incremental mining of frequent patterns without candidate generation or support constraint, in: Proceedings of the Seventh International Database Engineering and Applications Symposium (IDEAS), 2003.
11. Cormode G., and Muthukrishnan S. What's hot and what's not: tracking most frequent items dynamically. ACM Transactions on Database Systems 30 1 (2005) 249-278
12. Grahne G., and Zhu J. Fast algorithms for frequent itemset mining using FP-Trees. IEEE Transactions on Knowledge and Data Engineering 17 10 (2005) 1347-1362
13. Han J., Cheng H., Xin D., and Yan X. Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery (2007) 10th Anniversary Issue
14. J. Han, G. Dong, G. Yin, Efficient mining of partial periodic patterns in time series database, in: Proceedings of IEEE International Conference on Data Mining, 1999.
15. 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.
16. Hong T.-P., Lin C.-W., and Wu Y.-L. Incrementally fast updated frequent pattern trees. Expert Systems with Applications 34 4 (2008) 2424-2435
17. Hu T., Sung S.Y., Xiong H., and Fu Q. Discovery of maximum length frequent itemsets. Information Sciences 178 (2008) 69-87
18. H. Huang, X. Wu, R. Relue, Association analysis with one scan of databases, in: Proceedings of the IEEE International Conference on Data Mining, 2002, pp. 629-632.
19. IBM, QUEST Data Mining Project, .
20. Koh J.-L., and Shieh S.-F. An efficient approach for maintaining association rules based on adjusting FP-tree structures. In: Lee Y.-J., Li J., Whang K.-Y., and Lee D. (Eds). Proceedings of the DASFAA (2004), Springer-Verlag, Berlin Heidelberg, New York 417-424
21. Lee A.J.T., Hong R.W., Ko W.M., Tsao W.K., and Lin H.H. Mining spatial association rules in image databases. Information Sciences 177 7 (2007) 1593-1608
22. Lee A.J.T., and Wang C.-S. An efficient algorithm for mining frequent inter-transaction patterns. Information Sciences 177 (2007) 3453-3476
23. Lee Y.-S., and Yen S.-J. Incremental and interactive mining of web traversal patterns. Information Sciences 178 (2008) 287-306
24. Leung C.K., Khan Q.I., Li Z., and Hoque T. CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowledge and Information Systems 11 3 (2007) 287-311
25. Leung C.K.-S., Lakshmanan L.V.S., and Ng R.T. Exploiting succinct constraints using FP-trees. SIGKDD Explorer 4 1 (2002) 40-49
26. X. Li, X. Deng, S. Tang, A fast algorithm for maintenance of association rules in incremental databases, in: ADMA, 2006, pp. 56-63.
27. Li Q., Feng L., and Wong A. From intra-transaction to generalized inter-transaction: landscaping multidimensional contexts in association rule mining. Information Sciences 172 (2005) 361-395
28. Lin M.-Y., and Lee S.-Y. Interactive sequence discovery by incremental mining. Information Sciences 165 (2004) 187-205
29. Liua G., Lua H., and Yub J.X. CFP-tree: a compact disk-based structure for storing and querying frequent itemsets. Information Systems 32 (2007) 295-319
30. N.F. Ayan A.U. Tansel E. Akrun, An efficient algorithm to update large itemsets with early pruning, in: Proceedings of the fifty ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999, pp. 287 - 291.
31. Pei J., Han J., and Lakshmanan L.V.S. Mining frequent itemsets with convertible constraints. In: Buchmann A., and Georgakopoulos D. (Eds). Proceedings of the International Conference on Data Engineering (2001), IEEE Computer Society Press, Los Alamitos, CA 433-442
32. Tsay Y.J., and Chiang J.Y. An efficient cluster and decomposition algorithm for mining association rules. Information Sciences 160 1-4 (2004) 161-171
33. Wua F., Chiang S.-W., and Linb J.-R. A new approach to mine frequent patterns using item-transformation methods. Information Systems 32 (2007) 1056-1072
34. Zhang S., Zhang J., and Zhang C. EDUA: an efficient algorithm for dynamic database mining. Information Sciences 177 (2007) 2756-2767