Single-pass incremental and interactive mining for weighted frequent patterns

Expert Systems with Applications

Volumn 39, Issue 9, 2012, Pages 7976-7994

  Ahmed, Chowdhury Farhan ^a   Tanbeer, Syed Khairuzzaman ^a   Jeong, Byeong Soo ^a   Lee, Young Koo ^a   Choi, Ho Jin ^b  

^a Kyung Hee University   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Data mining; Incremental mining; Interactive mining; Knowledge discovery; Weighted frequent pattern mining

Indexed keywords

CANDIDATE PATTERNS; DATA MINING AND KNOWLEDGE DISCOVERY; DATABASE SCANS; FREQUENT PATTERN MINING; INCREMENTAL MINING; INTERACTIVE MINING; MEMORY SPACE; MINIMUM SUPPORT THRESHOLDS; MINING OPERATIONS; PERFORMANCE ANALYSIS; PREFIX TREES; RESEARCH ISSUES; STREAM DATA MINING; TREE STRUCTURES; TREE-BASED; WEIGHTED FREQUENT PATTERN MINING;

ALGORITHMS; DATA MINING; DATABASE SYSTEMS; FINITE DIFFERENCE METHOD; FORESTRY; SEMANTICS;

TREES (MATHEMATICS);

ALGORITHMS; DATA BASES; DATA PROCESSING; FORESTRY;

EID: 84862809529     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2012.01.117     Document Type: Article

References (43)

1. Agrawal, R.; Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In Proceedings of the 20th international conference on very large data bases, September (pp. 487-499).
2. Agrawal, R.; Imieliński, T.; Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the 12th ACM SIGMOD international conference on management of data, May (pp. 207-216).
3. Ahmed, C. F.; Tanbeer, S. K.; Jeong, B.-S.; Lee, Y.-K. (2008). Mining weighted frequent patterns in incremental databases. In: Proceeding of the 10th Pacific Rim international conference on artificial intelligence (pp. 933-938). Hanoi, Vietnam, December 15-19.
4. Cai, C. H.; Fu, A. W.; Cheng, C. H.; Kwong, W. W. (1998). Mining association rules with weighted items. In Proceedings of international database engineering and applications symposium, IDEAS 98 (pp. 68-77). Cardiff, Wales, UK.
5. J.H. Chang, and W.S. Lee Estwin: Online data stream mining of recent frequent itemsets by sliding window method Journal of information science 31 2 2005 76 90
6. L. Chang, T. Wang, D. Yang, H. Luan, and S. Tang Efficient algorithms for incremental maintenance of closed sequential patterns in large databases Data and Knowledge Engineering 68 2009 68 106
7. Cheung, W.; & Zaïane, O. R. (2003). Incremental mining of frequent patterns without candidate generation or support constraint. In Proceedings of the Seventh International Database Engineering and Applications, Symposium (IDEAS'03) (pp. 111-116).
8. J. Dong, and M. Han BitTableFI: An efficient mining frequent itemsets algorithm Knowledge-Based Systems 20 2007 329 335
9. G. Grahne, and J. Zhu Fast algorithms for frequent itemset mining using FP-Trees IEEE Transactions on Knowledge and Data Engineering 17 10 2005 1347 1362
10. J. Han, H. Cheng, D. Xin, and X. Yan Frequent pattern mining: current status and future directions Data Mining and Knowledge Discovery 15 2007 55 86
11. J. Han, J. Pei, Y. Yin, and R. Mao Mining frequent patterns without candidate generation: A frequent-pattern tree approach Data Mining and Knowledge Discovery 8 2004 53 87
12. T. Hu, S.Y. Sung, H. Xiong, and Q. Fu Discovery of maximum length frequent patterns Information Science 178 2008 69 87
13. N. Jiang, and L. Gruenwald Research issues in data stream association rule mining SIGMOD Record 35 1 2006
14. J.-L. Koh, and S.-F. Shieh An efficient approach for maintaining association rules based on adjusting FP-tree structures Proceedings of the DASFAA'04 2004 417 424
15. A.J.T. Lee, W.-K. Tsao, P.-Y. Chen, M.-C. Lin, and S.-H. Yang Mining frequent closed patterns in pointset databases Information Systems 35 2010 335 351
16. Y.-S. Lee, and S.-J. Yen Incremental and interactive mining of web traversal patterns Information Science 178 2008 287 306
17. C.K.-S. Leung, Q.I. Khan, Z. Li, and T. Hoque CanTree: A canonical-order tree for incremental frequent-pattern mining Knowledge and Information Systems 11 3 2007 287 311
18. H.-F. Li Interactive mining of top-k frequent closed itemsets from data streams Expert Systems with Applications 36 2009 10779 10788
19. X. Li, Z.-H. Deng, and S. Tang A fast algorithm for maintenance of association rules in incremental databases Advanced Data Mining and Applications (ADMA 06) 43 2006 56 63
20. A.H.L. Lim, and C.-S. Lee Processing online analytics with classification and association rule mining Knowledge-Based Systems 23 2010 248 255
21. C.-W. Lin, T.-P. Hong, and W.-H. Lu The Pre-FUFP algorithm for incremental mining Expert Systems with Applications 36 2009 9498 9505
22. A. Metwally, D. Agrawal, and A.E. Abbadi An integrated efficient solution for computing frequent and top-k elements in data streams ACM Transactions on Database Systems (TODS) 31 3 2006 1095 1133
23. Pei, J.; Han, J. (2000). CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proceedings of ACM SIGMOD workshop on research issues in data mining and knowledge discovery (pp. 21-30). USA.
24. J. Pei, J. Han, B. Mortazavi-Asl, J. Wang, H. Pinto, and Q. Chen Mining sequential patterns by pattern-growth: The PrefixSpan approach IEEE Transactions on Knowledge and Data Engineering 16 11 2004 1424 1440
25. C. Raissi, P. Poncelet, and M. Teisseire Towards a new approach for mining frequent itemsets on data stream Journal of Intelligent Information Systems 28 2007 23 36
26. W. Song, B. Yang, and Z. Xu Index-BitTableFI: An improved algorithm for mining frequent itemsets Knowledge-Based Systems 21 2008 507 513
27. S.K. Tanbeer, C.F. Ahmed, B.-S. Jeong, and Y.-K. Lee Efficient single-pass frequent pattern mining using a prefix-tree Information Sciences 179 5 2009 559 583
28. Tao, F. (2003). Weighted association rule mining using weighted support and significant framework. In Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 661-666). Washington, DC, USA.
29. K. Verma, and O.P. Vyas Efficient calendar based temporal association rule SIGMOD Record 34 3 2005 63 70
30. Wang, J.; Han, J.; Pei, J. (2003). CLOSET+: Searching for the best strategies for mining frequent closed itemsets. In Proceedings of the Ninth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 236-245). Washington, DC, USA.
31. W. Wang, J. Yang, and P.S. Yu WAR: Weighted association rules for item intensities Knowledge Information and Systems 6 2004 203 229
32. H. Xiong, P.-N. Tan, and V. Kumar Hyperclique pattern discovery Data Mining and Knowledge Discovery 13 2006 219 242
33. Ye, F.-Y.; Wang, J.-D.; Shao, B.-L. (2005). New algorithm for mining frequent itemsets in sparse database. In Proceeding of the 4th International Conference on Machine learning and Cybernetics (pp. 1554-1558).
34. J.X. Yu, Z. Chong, H. Lu, Z. Zhang, and A. Zhou A false negative approach to mining frequent itemsets from high speed transactional data streams Information Sciences 176 2006 1986 2015
35. U. Yun Efficient mining of weighted interesting patterns with a strong weight and/or support affinity Information Science 177 2007 3477 3499
36. U. Yun WIS: Weighted interesting sequential pattern mining with a similar level of support and/or weight ETRI Journal 29 3 2007
37. U. Yun Mining lossless closed frequent patterns with weight constraints Knowledge-Based Systems 20 2007 86 97
38. U. Yun A new framework for detecting weighted sequential patterns in large sequence databases Knowledge-Base Systems 21 2008 110 122
39. U. Yun An efficient mining of weighted frequent patterns with length decreasing support constraints Knowledge-Based Systems 21 2008 741 752
40. Yun, U.; Leggett, J. J. (2005). WFIM: weighted frequent itemset mining with a weight range and a minimum weight. In Proceedings of the fourth SIAM international conference on data mining (pp. 636-640). USA.
41. Yun, U.; Leggett, J. J. (2005b). WLPMiner: Weighted frequent pattern mining with length decreasing support constraints. In: Proceedings of the ninth Pacific-Asia conference on knowledge discovery and data mining (PAKDD) (pp. 555-567). Hanoi, Vietnam.
42. U. Yun, and J.J. Leggett WIP: Mining weighted interesting patterns with a strong weight and/or support affinity SDM'06 2006
43. S. Zhang, J. Zhang, and C. Zhang EDUA: An efficient algorithm for dynamic database mining Information Science 177 2007 2756 2767