Abstract
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the parameters of window size and absolute burst threshold, which are hard to be determined a priori, should be given in advance. 2) Only one side bursts, i.e. either increasing or decreasing bursts, can be detected. 3) Bumps, which are changes of aggregation data caused by noises, are often reported as bursts. The disturbance of bumps causes much effort in subsequent exploration of mining results. In this paper, a general burst model is introduced for overcoming above three problems. We develop an efficient algorithm for detecting adaptive aggregation bursts in a data stream given a burst ratio. With the help of a novel inverted histogram, the statistical summary is compressed to be fit in limited main memory, so that bursts on windows of any length can be detected accurately and efficiently on-line. Theoretical analysis show the space and time complexity bound of this method is relatively good, while experimental results depict the applicability and efficiency of our algorithm in different application settings.
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
Internet traffic archive, http://ita.ee.lbl.gov/
Ben-David, S., Gehrke, J., Kifer, D.: Detecting change in data streams. In: Proc. of VLDB (2004)
Cormode, G., Muthukrishnan, S.: What’s new: Finding significant differences in network data streams. In: Proc. of INFOCOM (2004)
Crovella, M.E., Taqqu, M.S., Bestavros, A.: Heavy-tailed probability distributions in the world wide web. A practical guide to heavy tails: Statistical Techniques and Applications, 3–26 (1998)
Garofalakis, M., Gibbons, P.B.: Wavelet synopses with error guarantees. In: Proc. of SIGMOD (2003)
Gilbert, A.C., et al.: Fast, small-space algorithms for approximate histogram maintenance. In: Proc. of STOC (2002)
Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. In: Proc. of VLDB (2001)
Guha, S., Koudas, N., Shim, K.: Datastreams and histograms. In: Proc. of STOC (2001)
Kleinberg, J.: Bursty and hierarchical structure in streams. In: Proc. of SIGKDD (2002)
Krishnamurthy, B., Sen, S., Zhang, Y., Chen, Y.: Sketch-based change detection: Methods, evaluation, and applications. In: Proc. of IMC (2003)
Muthukrishnan, S., Strauss, M.: Rangesum histograms. In: Proc. of SODA (2003)
Zhu, Y., Shasha, D.: Efficient elastic burst detection in data streams. In: Proc. of SIGKDD (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, A., Qin, S., Qian, W. (2005). Adaptively Detecting Aggregation Bursts in Data Streams. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_39
Download citation
DOI: https://doi.org/10.1007/11408079_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25334-1
Online ISBN: 978-3-540-32005-0
eBook Packages: Computer ScienceComputer Science (R0)