An efficient mining of weighted frequent patterns with length decreasing support constraints

Knowledge-Based Systems

Volumn 21, Issue 8, 2008, Pages 741-752

  Yun, Unil ^a  

^a Chungbuk National University   (South Korea)

Author keywords

Data mining; Knowledge discovery; Length decreasing support constraint; Weighted frequent pattern mining; Weighted Smallest Valid Extension property

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; ASSOCIATIVE PROCESSING; DATA MINING; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE MANAGEMENT;

BROAD APPLICATIONS; DATA MINING TASKS; EFFICIENT; FREQUENT PATTERN MININGS; FREQUENT PATTERNS; GRAPH PATTERNS; KNOWLEDGE DISCOVERY; LENGTH DECREASING SUPPORT CONSTRAINT; MINIMUM WEIGHTS; MINING ALGORITHMS; MINING ASSOCIATION RULES; NODE PRUNING; PATTERN GROWTHS; PRUNING; PRUNING TECHNIQUES; REAL WORLDS; SEQUENTIAL PATTERNS; WEIGHT CONSTRAINTS; WEIGHTED FREQUENT PATTERN MINING; WEIGHTED SMALLEST VALID EXTENSION PROPERTY;

MINING;

EID: 54949091160     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.knosys.2008.03.059     Document Type: Article

References (37)

1. R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, VLDB, September 1994.
2. R. Agrawal, T. Imieliński, A. Swami, Mining association rules between sets of items in large databases, ACM SIGMOD, May 1993.
3. F. Bonchi, C. Lunnhese, On closed constrained frequent pattern mining, ICDM'04, November 2004.
4. F. Bonchi, C. Lunnhese, Pushing tougher constraints in frequent pattern mining, PAKDD'05, May 2005.
5. C.H. Cai, A.W.-C. Fu, C.H. Cheng, W.W. Kwong, Mining association rules with weighted items, IDEAS'98, Cardiff, Wales, UK, July 1998.
6. Chen M.S., Han J., and Yu P.S. An overview from database perspective. IEEE Transactions on Knowledge and Data Engineering (1996)
7. Y. Chi, H. Wang, R.R. Muntz, Moment: maintaining closed frequent itemsets over a stream sliding window, ICDM'04, November 2004.
8. K. Gade, J. Wang, G. Karypis, Efficient closed pattern mining in the presence of tough block constraints, ACM SIGKDD, August 2004.
9. Han J., and Kamber M. Data Mining Concepts and Techniques (2001), Morgan Kaufman
10. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, ACM SIGMOD, May 2000.
11. 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 (2004)
12. C.K. Leung, L.V.S. Lakshmanan, Exploiting succinct constraints using FP-trees, ACM SIGKDD Explorations, 4, 2002.
13. G. Liu, H. Lu, Y. Xu, J.X. Yu, Ascending frequency ordered prefix-tree: efficient mining of frequent patterns, DASFAA, 2003.
14. J. Liu, Y. Pan, K. Wang, J. Han, Mining frequent item sets by opportunistic projection, in: Proceedings of the Eighth ACM SIGKDD, July 2002.
15. R.T. Ng, L.V.S. Lakshmanan, J. Han, Exploratory mining and pruning optimizations of constrained association rules, SIGKDD'98, August 1998.
16. Omiecinski E.R. Alternative interest measures for mining associations in databases. IEEE Transaction on Knowledge and Data Engineering (2003)
17. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, Discovering frequent closed itemsets for association rules, ICDT'99, 1999.
18. J. Pei, J. Han, CLOSET: an efficient algorithm for mining frequent closed itemsets, DMKD, May 2000.
19. J. Pei, J. Han, L.V.S. Lakshmanan, Mining frequent itemsets with convertible constraints, ICDE 2001, April 2001.
20. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, D. Yang, H-Mine: hyper-structure mining of frequent patterns in large databases, ICDM, November/December 2001.
21. Pei J., Han J., Wang J., Pinto H., Chen Q., Dayal U., and Hsu M.C. Mining sequential patterns by pattern-growth: the PrefixSpan approach. IEEE Transactions on Knowledge and Data Engineering (2004)
22. A. Savasere, E. Omiecinski, S. Navathe, An efficient algorithm for mining association rules in large databases, VLDB, 1995.
23. M. Seno, G. Karypis, LPMiner: an algorithm for finding frequent itemsets using length decreasing support constraint, ICDM'01, November 2001.
24. Seno M., and Karypis G. Finding frequent patterns using length-decreasing support constraints. Data Mining and Knowledge Discovery (2005)
25. M. Steinbach, P.N. Tan, H. Xiong, V. Kumar, Generalizing the notion of support, ACM SIGKDD, August 2004.
26. F. Tao, Weighted association rule mining using weighted support and significant framework, ACM SIGKDD, August 2003.
27. J. Wang, J. Han, J. Pei, CLOSET+: searching for the best strategies for mining frequent closed itemsets, ACM SIGKDD, August 2003.
28. K. Wang, Y. He, J. Han, Mining frequent itemsets using support constraints, VLDB, September 2000.
29. J. Wang, G. Karypis, BAMBOO: accelerating closed itemset mining by deeply pushing the length-decreasing support constraint, SDM'04, April 2004.
30. Wang W., Yang J., and Yu P.S. WAR: weighted association rules for item intensities. Knowledge Information and Systems (2004)
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, ACM SIGKDD, August 2004.
32. U. Yun, J.J. Leggett, WFIM: weighted frequent itemset mining with a weight range and a minimum weight, in: International Conference on SIAM Data Mining (SDM'05), April 2005.
33. U. Yun, J.J. Leggett, WLPMiner: WLPMiner: weighted frequent pattern mining with length-decreasing support constraints, PAKDD'05, May 2005.
34. U. Yun, J.J. Leggett, WIP: weighted interesting pattern mining with a strong weight and/or support affinity, in: International Conference on SIAM Data Mining (SDM'06), April 2006.
35. Yun U., and Leggett J.J. WSpan: weighted sequential pattern mining in large sequence databases. IEEE International Conference on Intelligent Systems (IEEE IS'06) (2006)
36. Yun U. Mining lossless closed frequent patterns with weight constraints. Knowledge Based Systems 210 (2007) 86-97
37. M.J. Zaki, C.J. Hsiao, CHARM: an efficient algorithm for closed itemset mining, SDM'02, April, 2002.