Abstract
This paper proposes a method for mining the frequent patterns in an arbitrary sliding window of data streams. As streams flow, the contents of which are captured with SWP-tree by scanning the stream only once, and the obsolete and infrequent patterns are deleted by periodically pruning the tree. To differentiate the patterns of recently generated transactions from those of historic transactions, a time decaying model is also applied. The experimental results show that the proposed method is efficient and scalable, and it is superior to other analogous algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yu, J.X., Chong, Z., Lu, H., Zhang, Z., Zhou, A.: A false negative approach to mining frequent itemsets from high speed transactional data streams. Information Sciences 176, 1986–2015 (2006)
Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining frequent patterns in data streams at multiple time granularities. In: Data Mining: Next Generation Challenges and Future Directions, pp. 191–212. AAAI/MIT Press (2004)
Chang, J.H., Lee, W.S.: Finding recent frequent itemsets adaptively over online data streams. In: ACM SIGKDD 2003, August 2003, pp. 487–492. ACM Press, New York (2003)
Leung, C.K.-S., Khan, Q.I.: DStree: A tree structure for the mining of frequent sets from data streams. In: ICDM 2006, December 2006, pp. 928–932. IEEE press, Los Alamitos (2006)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000, May 2000, pp. 1–12. ACM press, New York (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, G., Chen, H., Yang, B., Chen, G. (2008). Mining Frequent Patterns in an Arbitrary Sliding Window over Data Streams. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds) Database Systems for Advanced Applications. DASFAA 2008. Lecture Notes in Computer Science, vol 4947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78568-2_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-78568-2_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78567-5
Online ISBN: 978-3-540-78568-2
eBook Packages: Computer ScienceComputer Science (R0)