Syed Khairuzzaman Tanbeer
ABSTRACT
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed data stream. The CPS-tree introduces the concept of dynamic tree restructuring technique in handling stream data that allows it to achieve highly compact frequency-descending tree structure at runtime and facilitates an efficient FP-growth-based [1] mining technique.
- Han, J., Pei, J., and Yin Y. 2000. Mining frequent patterns without candidate generation. In Proc. of Int. Conf. on Management of Data. 1--12. Google Scholar
Digital Library
- Koh, J.-L., and Shieh, S.-F. 2004. An efficient approach for maintaining association rules based on adjusting FP-tree structures. In Lee Y.-J., Li J., Whang K.-Y., Lee D. (eds) Proc. of DASFAA 2004. Springer-Verlag, Berlin Heidelberg New York, 417--424.Google Scholar
- Leung, C. K.-S., and Khan, Q. I. 2006. DSTree: A tree structure for the mining of frequent sets from data streams. In Proc. of the 6th Int. Conf. on Data Mining (ICDM). 928--932. Google ScholarDigital Library
- Tanbeer, S. K., Ahmed, C. F., Jeong, B.-S., and Lee, Y.-K. 2008. CP-tree: a tree structure for single-pass frequent pattern mining. In Proc. of PAKDD, Lect Notes Artif Int, 1022--1027. Google ScholarDigital Library
Index Terms
- Efficient frequent pattern mining over data streams
Recommendations
Efficient Mining of Weighted Frequent Patterns over Data Streams
HPCC '09: Proceedings of the 2009 11th IEEE International Conference on High Performance Computing and CommunicationsBy considering different weights of the items, weighted frequent pattern (WFP)mining can discover more important knowledge compared to traditional frequent pattern mining. Therefore, WFP mining becomes an important research issue in data mining and ...
Mining maximal frequent itemsets from data streams
Frequent pattern mining from data streams is an active research topic in data mining. Existing research efforts often rely on a two-phase framework to discover frequent patterns: (1) using internal data structures to store meta-patterns obtained by ...
Sliding window-based frequent pattern mining over data streams
Finding frequent patterns in a continuous stream of transactions is critical for many applications such as retail market data analysis, network monitoring, web usage mining, and stock market prediction. Even though numerous frequent pattern mining ...
Comments