Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2010.17D.4.253

Efficient Dynamic Weighted Frequent Pattern Mining by using a Prefix-Tree  

Jeong, Byeong-Soo (경희대학교 컴퓨터공학과)
Farhan, Ahmed (경희대학교 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartD / v.17D, no.4, 2010 , pp. 253-258 More about this Journal
Abstract
Traditional frequent pattern mining considers equal profit/weight value of every item. Weighted Frequent Pattern (WFP) mining becomes an important research issue in data mining and knowledge discovery by considering different weights for different items. Existing algorithms in this area are based on fixed weight. But in our real world scenarios the price/weight/importance of a pattern may vary frequently due to some unavoidable situations. Tracking these dynamic changes is very necessary in different application area such as retail market basket data analysis and web click stream management. In this paper, we propose a novel concept of dynamic weight and an algorithm DWFPM (dynamic weighted frequent pattern mining). Our algorithm can handle the situation where price/weight of a pattern may vary dynamically. It scans the database exactly once and also eligible for real time data processing. To our knowledge, this is the first research work to mine weighted frequent patterns using dynamic weights. Extensive performance analyses show that our algorithm is very efficient and scalable for WFP mining using dynamic weights.
Keywords
Data Mining; Knowledge Discovery; Weighted Frequent Pattern Mining; Dynamic Weight;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Metwally, D. Agrawal, A. E.Abbadi, “An Integrated Efficient Solution for Computing Frequent and Top-k Elements in Data Streams,” ACM Transactions on Database Systems (TODS), Vol.31, No.3, 2006, pp.1095-1133.   DOI   ScienceOn
2 N. Jiang and L. Gruenwald, “Research Issues in Data Stream Association Rule Mining,” SIGMOD Record, Vol. 35, No. 1, Mar., 2006, pp.14-19.   DOI   ScienceOn
3 C. K. -S. Leung, Q. I. Khan, “DSTree: A Tree structure for the mining of frequent Sets from Data Streams,” Proc. of the 6th Int. Conf. on Data Mining (ICDM’06), 2006, pp.928-932.   DOI
4 J.-L. Koh, S.-F. Shieh, “An efficient approach for maintaining association rules based on adjusting FP-tree structures,” Proc. of the DASFAA’04, 2004, pp.417-424.
5 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, Vol.11, No.3, 2007, pp.287-311.   DOI
6 U. Yun, “Mining lossless closed frequent patterns with weight constraints,” Knowledge-Based Systems, Vol.210, 2007, pp.86-97.
7 S.K. Tanbeer, C.F. Ahmed, B.-S. Jeong and Y.-K. Lee, “CP-tree: A tree structure for single pass frequent pattern mining,” Proc. of the 12th Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD’08), 2008.   DOI   ScienceOn
8 U. Yun, “Efficient Mining of weighted interesting patterns with a strong weight and/or support affinity,” Information Sciences, vol. 177, 2007, pp.3477-3499.   DOI   ScienceOn
9 C.H. Cai, A.W. Fu, C.H. Cheng, W.W. Kwong, “Mining association rules with weighted items,” Proc. of Int. Database Engineering and Applications Symposium, IDEAS 98, Cardiff, Wales, UK, 1998, pp. 68-77.   DOI
10 C.F. Ahmed, S.K. Tanbeer, B.-S. Jeong and Y.-K. Lee, “Mining Weighted Frequent Patterns in Incremental Databases”, Proc. of the 10th Pacific Rim Int. Conf. on Artificial Intelligence, Dec. 2008, pp.933-938.
11 F. Tao, “Weighted association rule mining using weighted support and significant framework,” Proc. of the 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, USA, 2003, pp. 661-666.   DOI
12 J. Han, H. Cheng, D. Xin, X. Yan, “Frequent pattern mining: current status and future directions,” Data Mining and Knowledge Discovery, Vol.15, 2007, pp.55-86.   DOI
13 W. Wang, J. Yang, P.S. Yu, “WAR: weighted association rules for item intensities,” Knowledge Information and Systems, Vol.6, 2004, pp.203-229.   DOI
14 J. Han, J. Pei, Y. Yin, R. Mao, “Mining frequent patterns without candidate generation: a frequent-pattern tree approach,” Data Mining and Knowledge Discovery, Vol.8, 2004, pp. 53-87.   DOI   ScienceOn
15 G. Grahne, and J. Zhu, “Fast Algorithms for frequent itemset mining using FP-Trees,” IEEE Transactions on Knowledge and Data Engineering, Vol.17, No.10, Oct., 2005, pp.1347-1362.   DOI   ScienceOn
16 R. Agrawal, T. Imieliński and A. Swami, “Mining association rules between sets of items in large databases,” Proc. of the 12th ACM SIGMOD Int. Conf. on Management of Data, May 1993, pp.207-216.   DOI
17 U. Yun, J.J. Leggett, “WFIM: weighted frequent itemset mining with a weight range and a minimum weight,” Proc. of the Fourth SIAM Int. Conf. on Data Mining, USA, 2005, pp.636-640.
18 R. Agrawal, R. Srikant, “Fast Algorithms for Mining Association Rules in Large Databases,” Proc. of the 20th Int. Conf. on Very Large Data Bases, Sep., 1994, pp.487-499.