On pushing weight constraints deeply into frequent itemset mining

Intelligent Data Analysis

Volumn 13, Issue 2, 2009, Pages 359-383

  Yun, Unil ^a  

^a Chungbuk National University   (South Korea)

Author keywords

Data mining; Minimum weight; Weighted frequent pattern mining; Weighted support

Indexed keywords

EID: 65449115685     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/IDA-2009-0370     Document Type: Article

References (34)

1. R. Agrawal, T. Imieliński and A. Swami, Mining Association Rules between Sets of Items in Large Databases, ACM SIGMOD, May 1993.
2. R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules in Large Databases, VLDB, Sep. 1994.
3. F. Bodon, A fast APRIORI Implementation, IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), Nov. 2003.
4. F. Bonchi and C. Lunnhese, On Closed Constrained Frequent Pattern Mining, IEEE ICDM'04, Nov. 2004.
5. F. Bonchi and C. Lunnhese, Pushing Tougher Constraints in Frequent Pattern Mining, PAKDD, May 2005.
6. C. Borgelt, Efficient Implementations of Apriori and Eclat, IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), Nov, 2003.
7. C.H. Cai, A.W. Fu, C.H. Cheng and W.W. Kwong, Mining Association Rules with Weighted Items, IDEAS'98, July 1998.
8. Y. Chi, H. Wang and R.R. Muntz, Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window, IEEE ICDM'04, Nov. 2004.
9. A. Das, Rapid Association Rule Mining, ACM CIKM, 2001.
10. K. Gade, J. Wang and G. Karypis, Efficient Closed Pattern Mining in the Presence of Tough Block Constraints, ACM SIGKDD, Aug. 2004.
11. J. Han and Y. Fu, Mining Multiple-Level Association Rules in Large Databases, IEEE Transactions on Knowledge and Data Engineering, Sep/ Oct 1999.
12. J. Han, J. Pei and Y. Yin, Mining Frequent Patterns without Candidate Generation, SIGMOD, May 2000.
13. 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, 2004.
14. L.V.S. Lakshmanan, R.T. Ng, J. Han and A. Pang, Optimization of Constrained Frequent Set Queries with 2-variable Constraints, SIGMOD Conference 1999.
15. C.K. Leung and L.V.S. Lakshmanan, Exploiting Succinct Constraints using FP-trees, ACM SIGKDD Explorations, Volume 4, 2002.
16. B. Liu, W. Hsu and Y. Ma, Mining Association Rules with Multiple Minimum Supports, ACM SIGKDD, June 1999.
17. G. Liu, H. Lu, Y. Xu and J.X. Yu, Ascending Frequency Ordered Prefix-tree: Efficient Mining of Frequent Patterns, DASFAA, 2003.
18. J. Liu, Y. Pan, K. Wang and J. Han, Mining Frequent Item Sets by Opportunistic Projection, ACM SIGKDD, July 2002.
19. Raymond T. Ng, Laks V.S. Lakshmanan, Jiawei Han and Alex Pang, Exploratory Mining and Pruning Optimizations of Constrained Association Rules, SIGMOD Conference 1998: 13-24.
20. E.R. Omiecinski, Alternative Interest Measures for Mining Associations in Databases, IEEE Transaction on Knowledge and Data Engineering, 2003.
21. J. Pei, J. Han and L.V.S. Lakshmanan, Mining frequent Itemsets with Convertible Constraints, ICDE 2001, April 2001.
22. J. Pei, J. Han et al., Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach, IEEE Transactions on Knowledge and Data Engineering, Oct 2004.
23. M. Steinbach, P.N. Tan, H. Xiong and V. Kumar, Generalizing the Notion of Support, ACM SIGKDD, Aug. 2004.
24. F. Tao, Weighted Association Rule Mining using Weighted Support and Significant Framework, ACM SIGKDD, Aug. 2003.
25. J. Wang, J. Han and J. Pei, CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets, ACM SIGKDD, Aug. 2003.
26. J. Wang, J. Han, Y. Lu and P. Tzvetkov, TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets, IEEE Transactions on Knowledge and Data Engineering, 2005.
27. W. Wang, J. Yang and P.S. Yu, WAR: Weighted Association Rules for Item Intensities, Knowledge Information and Systems, 2004.
28. H. Xiong, P.N. Tan and V. Kumar, Mining Strong Affinity Association Patterns in Data Sets with Skewed Support Distribution, IEEE ICDM, Dec. 2003.
29. H. Xiong, S. Shekhar, P.N. Tan and V. Kumar, Exploiting A Support-based Upper Bound of Pearson's Correlation Coefficient for Efficiently Identifying Strongly Correlated Pairs, ACM SIGKDD, Aug. 2004.
30. X. Yan and J. Han, gSpan: Graph-Based Substructure Pattern Mining, IEEE ICDM'02, Dec. 2002.
31. U. Yun and J.J. Leggett, WFIM: Weighted Frequent Itemset Mining with a Weight Range and a Minimum Weight, International Conference on SIAM Data Mining (SDM'05), April 2005.
32. Unil Yun, A new framework for detecting weighted sequential patterns in large sequence databases, Knowledge-Based System 21(2) (March 2008), 110-122.
33. M.J. Zaki and K. Gouda, Fast Vertical Mining using Diffsets, ACM SIGKDD, Aug. 2003.
34. Z. Zheng, Real World Performance of Association Rule Algorithms, ACM SIGKDD, 2001.