Detecting Lasting and Abrupt Bursts in Data Streams Using Two-Layered Wavelet Tree

Authors:
Tingting Chen;Yi Wang;Binxing Fang;Jun Zheng
Affiliations:
Harbin Institute of Technology;Harbin Institute of Technology;Harbin Institute of Technology;Harbin Institute of Technology
Venue:
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Year:
2006

Citing 0
Cited 2

Online Burst Detection Over High Speed Short Text Streams

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Opt-in detection based on call detail records

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real-time network and telecommunication systems often generate tremendous volume of streaming data. Effective modeling of such streaming data and detecting the bursts with single-scan algorithms pose great challenges. The aim of detecting bursts in data streams is to find anomalous aggregation in stream subsequences. We introduce Lasting Factor and Abrupt Factor in the general definition of burst, in order to characterize how a burst grows in real applications. A novel two-layered wavelet tree structure is designed to detect lasting bursts and abrupt bursts in linear time. Our algorithm reports appearance time range and average aggregate value for lasting bursts, break point position and peak value for abrupt bursts. Theoretical analysis and comparison experiments on the Internet Traffic Archive dataset verify the superiority of our approach over other burst detection algorithms in burst characterization and computation efficiency.