Efficient mining of weighted interesting patterns with a strong weight and/or support affinity

Information Sciences

Volumn 177, Issue 17, 2007, Pages 3477-3499

  Yun, Unil ^a  

^a Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

Author keywords

Correlation; Data mining; h Confidence; Knowledge discovery; Performance evaluation; w Confidence; Weight affinity

Indexed keywords

COMPUTATIONAL METHODS; CORRELATION METHODS; DATA MINING; DATA STRUCTURES;

FREQUENT PATTERNS; PATTERN MINING; PERFORMANCE EVALUATION; WEIGHT AFFINITY;

ALGORITHMS;

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

References (41)

1. R. Agrawal, T. Imieliński, A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of 12th ACM SIGMOD International Conference on Management of Data, Washington, DC, USA, 1993, pp. 207-216.
2. R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in: Proceedings of 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile, 1994, pp. 487-499.
3. F. Bonchi, C. Lucchese, Pushing tougher constraints in frequent pattern mining, in: Proceedings of Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, PAKDD 2005, Hanoi, Vietnam, 2005, pp. 114-124.
4. C. Bucila, J. Gehrke, D. Kifer, W. White, DualMiner: a dual pruning algorithm for itemsets with constraints, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM KDD'02, Edmonton, Alberta, Canada, 2002, pp. 42-51.
5. C.H. Cai, A.W. Fu, C.H. Cheng, W.W. Kwong, Mining association rules with weighted items, in: Proceedings of International Database Engineering and Applications Symposium, IDEAS 98, Cardiff, Wales, UK, 1998, pp. 68-77.
6. Cheung Y.L., and Fu A.W. Mining frequent itemsets without support threshold: with and without item constraints. IEEE Transaction on Knowledge and Data Engineering 16 (2004) 1052-1069
7. K. Gade, J. Wang, G. Karypis, Efficient closed pattern mining in the presence of tough block constraints, in: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, 2004, pp. 138-147.
8. G. Grahne, L.V.S. Lakshmanam, X. Wang, Efficient mining of constrained correlated sets, in: Proceedings of the 16th International Conference on Data Engineering, San Diego, CA, USA, 2000, pp. 512-521.
9. Han J., and Fu Y. Mining multiple-level association rules in large databases. IEEE Transactions on Knowledge and Data Engineering 11 (1999) 798-804
10. Han J., Pei J., Yin Y., and Mao R. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery 8 (2004) 53-87
11. Hsu P.Y., Chen Y.L., and Ling C.C. Algorithms for mining association rules in bag databases. Information Sciences 166 (2004) 31-47
12. Huang Y., Xiong H., Wu W., Deng P., and Zhang Z. Mining maximal hyperclique pattern: a hybrid search strategy. Information Sciences 177 (2007) 703-721
13. Y. Lee, W. Kim, Y.D. Cai, J. Han, CoMine: efficient mining of correlated patterns, in: Proceedings of the 3rd IEEE International Conference on Data Mining, ICDM'03, Melbourne, FL, USA, 2003, pp. 581-584.
14. Lee A.J.T., Lin W.C., and Wang C.S. Mining association rules with multi-dimensional constraints. The Journal of Systems and Software 79 (2006) 79-92
15. 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 (2006) 1003-1031
16. Lin M.Y., and Lee S.Y. Interactive sequence discovery by incremental mining. Information Sciences 165 (2004) 187-205
17. B. Liu, W. Hsu, Y. Ma, Mining association rules with multiple minimum supports, in: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, 1999, pp. 337-341.
18. J. Liu, Y. Pan, K. Wang, J. Han, Mining frequent item sets by opportunistic projection, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada. 2002, pp. 229-238.
19. Ma S., and Hellersteing J.L. Mining mutually dependent patterns. Proceedings of the 2001 IEEE International Conference on Data Mining (2001), IEEE ICDM, San Jose, CA, USA 409-416
20. Omiecinski E.R. Alternative interest measures for mining associations in databases. IEEE Transaction on Knowledge and Data Engineering 15 (2003) 57-69
21. J. Pei, J. Han, CLOSET: An efficient algorithm for mining frequent closed itemsets, in: Proceedings of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, TX, USA, 2000, pp. 21-30.
22. Pei J., and Lakshmanan L.V.S. Mining frequent itemsets with convertible constraints. Proceedings of the 17th International Conference on Data Engineering (2001), Heidelberg, Germany 433-442
23. M. Steinbach, P.N. Tan, H. Xiong, V. Kumar, Generalizing the Notion of Support, in: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, 2004, pp. 689-694.
24. F. Tao, 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, Washington, DC, USA, 2003, pp. 661-666.
25. P.N. Tan, V. Kumar, J. Srivastava, Selecting the right interestingness measure for association patterns, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, 2002, pp. 32-41.
26. J. Wang, J. Han, J. Pei, 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, Washington, DC, USA, 2003, pp. 236-245.
27. Wang J., Han J., Lu Y., and Tzvetkov P. TFP: an efficient algorithm for mining top-k frequent closed itemsets. IEEE Transactions on Knowledge and Data Engineering 17 (2005) 652-664
28. K. Wang, L. Tang, J. Han, J. Liu, Top down FP-growth for association rule mining, in: Proceedings of Advances in Knowledge Discovery and Data Mining, 6th Pacific-Asia Conference, Taipei, Taiwan, 2002, pp. 334-340.
29. Wang C.Y., Tseng S.S., and Hong T.P. Flexible online association rule mining based on multidimensional pattern relations. Information Sciences 176 (2006) 1752-1780
30. Wang W., Yang J., and Yu P.S. WAR: weighted association rules for item intensities. Knowledge Information and Systems 6 (2004) 203-229
31. H. Xiong, S. Shekhar, P.N. Tan, V. Kumar, Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pairs, in: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, 2004, pp. 334-343.
32. H. Xiong, P.N. Tan, V. Kumar, Mining strong affinity association patterns in data sets with skewed support distribution, in: Proceedings of the 3rd IEEE International Conference on Data Mining, Melbourne, FL, USA, 2003, pp. 387-394.
33. X. Yan, J. Han, gSpan: Graph-based substructure pattern mining, in: Proceedings of the 2002 IEEE International Conference on Data Mining, Maebashi City, Japan, 2002, pp. 721-724.
34. 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 (2006) 1986-2015
35. U. Yun, J.J. Leggett, WFIM: weighted frequent itemset mining with a weight range and a minimum weight, in: Proceedings of the Fourth SIAM International Conference on Data Mining, Newport Beach, CA, USA, 2005, pp. 636-640.
36. U. Yun, J.J. Leggett, WLPMiner: Weighted frequent pattern mining with length decreasing support constraints, in: Proceedings of the Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining, Hanoi, Vietnam, 2005, pp. 555-567.
37. U. Yun, J.J. Leggett, WSpan: weighted sequential pattern mining in large sequence databases, in: Proceedings of International conference on IEEE Intelligent Systems, 2006.
38. Yun U. Mining lossless closed frequent patterns with weight constraints. Knowledge Based Systems 210 (2007) 86-97
39. U. Yun, WIS: Weighted Interesting Sequential pattern mining with a similar level of support and/or weight, ETRI Journal 29 (2007), in press.
40. M. Zaki, C.J. Hsiao, Charm: an efficient algorithm for closed itemset mining, in: Proceedings of the SIAM International Conference on Data Mining, Arlington, VA, USA, 2002.
41. Zhong S. Privacy-preserving algorithms for distributed mining of frequent itemsets. Information Sciences 177 (2007) 490-503