Mining Frequent Itemsets with Normalized Weight in Continuous Data Streams
2
조회
0
다운로드
5
인용
0
참고문헌
키워드
초록
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Data mining over data streams should support the flexible trade-off between processing time and mining accuracy. In many application areas, mining frequent itemsets has been suggested to find important frequent itemsets by considering the weight of itemsets. In this paper, we present an efficient algorithm WSFI (Weighted Support Frequent Itemsets)-Mine with normalized weight over data streams. Moreover, we propose a novel tree structure, called the Weighted Support FP-Tree (WSFP-Tree), that stores compressed crucial information about frequent itemsets. Empirical results show that our algorithm outperforms comparative algorithms under the windowed streaming model.
Abstract
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Data mining over data streams should support the flexible trade-off between processing time and mining accuracy. In many application areas, mining frequent itemsets has been suggested to find important frequent itemsets by considering the weight of itemsets. In this paper, we present an efficient algorithm WSFI (Weighted Support Frequent Itemsets)-Mine with normalized weight over data streams. Moreover, we propose a novel tree structure, called the Weighted Support FP-Tree (WSFP-Tree), that stores compressed crucial information about frequent itemsets. Empirical results show that our algorithm outperforms comparative algorithms under the windowed streaming model.
참고문헌 (17)
- M.M. Gaber, "Mining data streams: a review", ACM SIGMOD record, 34(2), pp.18~26 (2005)
- J. Chang, "A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams", Journal of Information Science and Engineering, 20(4) (2004)
- G.S. Manku, "Approximate Frequency Counts Over Data Streams", In Proceedings of the 28th International Conference on Very Large Data Bases, pp.346~357 (2002)
- C.H. Lee, "Sliding window filtering: An efficient method for incremental min-ing on a time-variant database", Information Systems, 30, pp.227~244 (2005)
- H.F Li, "An Efficient Algorithm for Mining Frequent Itemsets over the Entire History of Data Streams", In Proceedings of First International Workshop on Knowledge Discovery in Data Streams 9IWKDDS (2004)
- H.F Li, "Online Mining (Recently) Maximal Frequent Itemsets over Data Streams", Proceedings of the 15th IEEE International Workshop on Research Issues on Data Engineering (RIDE) (2005)
- H. Yao, "A Foundational Approach to Mining Itemset Utilities from Data-bases", Proceedings of the 4th SIAM International Conference on Data Mining (2004)
- C.J Chu, "An efficient algorithm for mining temporal high utility itemsets from data streams", The Journal of System and Software, 81, pp.1105~1117 (2008)
- C. Giannella, "Mining Frequent Patterns in Data Streams at Multiple Time Granularities", Next Generation Data Mining (2003)
- C.H. Cai, "Mining association rules with weighted items", Proceedings of the International Database Engineering and Applications Symposium, pp.68~77 (1998)
- F.Tao, "Weighted association rule mining using weighted support and significant framework", Proceedings of the 9th ACM SIGKDD, Knowledge Discovery and Data Mining, pp.661~666 (2003)
- W. Wang, "WAR: weighted association rules for item intensities", Knowledge Information and Systems, 6, pp.203~229 (2004)
- R. Agrawal, "Fast Algorithms for Mining Association Rules", Proceedings of the 20th VLDB conference, pp.487~499 (1994)
- U. Yun, "WFIM: weighted frequent itemset mining with a weight range and a minimum weight", In Proceedings of the 15th SIAM International Conference on Data Mining (SDM’05), pp.636~640 (2005)
- U.Yun, "Efficient Mining of weighted interesting patterns with a strong weight and", or support affinity, 2007, pp.177, 3477~3499
- C.F. Ahmed, "Efficient Mining of Weighted Frequent Patterns Over Data Streams", 2009 11th International Conference on High Performance Computing and Communica-tions, pp.400~406 (2009)
- J. Han, "Mining Frequents without Candidate Generation: A Frequent-Pattern Tree Approach", Data Mining and Knowledge Discovery, 8, pp.53~87 (2004)