By Topic

A Fast Search Algorithm of Anomaly in Data Streams Based on Shifted Wavelet Tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ying-Hui Kong ; Dept. of Electron. & Commun. Eng., North China Electr. Power Univ., Baoding ; Yun-Jie Lv ; Jin-Sha Yuan ; Yan-Ming Liu

Anomaly detection is to find aggregate which is different from the most aggregates. Aiming at the limitation of the anomaly detection algorithm of shifted wavelet tree (SWT) in data streams, we propose the improved algorithm which constructs the monotonic search space for binary search after removing the disturbance of bumps to increase the efficiency of detection, and uses the real-time incremental update algorithm for meeting the requirement of the online processing of the data streams. The simulation experiments using two data sets of the Gamma Ray and the Power Quality Disturbance (PQD) verify the high effectiveness and accuracy of our algorithm.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:4 )

Date of Conference:

12-14 Dec. 2008