Abstract
The analysis and management of uncertain data has attracted a lot of attention recently in many important applications such as pattern recognition and sensor network. Frequent itemset mining is often useful in analyzing uncertain data in those applications. However, previous works just focus on the static uncertain data instead of uncertain streams. In this paper, we study the problem of mining top-k FIs in uncertain streams. We propose an efficient algorithm, called UTK-FI, based on sliding-window and Chernoff bound techniques for finding k most frequent itemsets of different sizes. Experimental results show that our algorithm performs much better than many established methods in uncertain streams environment.
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
Aggarwal, C.C., Yu, P.S.: A Framework for Clustering Uncertain Data Streams. In: Proc. of 34th ICDE, Cancún, México, pp. 150–159 (2008)
Cormode, G., Garofalakis, M.: Sketching Probabilistic Data Streams. In: Proc. of ACM SIGMOD, Beijing, China, pp. 281–292 (2007)
Manku, G., Motwani, R.: Approximate Frequency Counts over Data Streams. In: Proc. of the 28th VLDB, Hong Kong, China, pp. 346–357 (2002)
Chernoff, H.: A Measure of Asymptotic Efficiency for Tests of a hypothesis Based on the Sum of Observations. The Annals of Mathematical Statistics 23(4), 493–507 (1952)
Zimányi, E., Pirotte, A.: Imperfect information in relational databases. In: Uncertainty Management in Information Systems, pp. 35–88 (1996)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proc. of the 20th ICDE, pp. 487–499. Morgan Kaufmann, San Francisco (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Peng, H. (2009). A Sliding-Window Approach for Finding Top-k Frequent Itemsets from Uncertain Streams. In: Li, Q., Feng, L., Pei, J., Wang, S.X., Zhou, X., Zhu, QM. (eds) Advances in Data and Web Management. APWeb WAIM 2009 2009. Lecture Notes in Computer Science, vol 5446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00672-2_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-00672-2_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00671-5
Online ISBN: 978-3-642-00672-2
eBook Packages: Computer ScienceComputer Science (R0)