loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth IEEE International Conference on Data Mining (ICDM'05)
Atomic Wedgie: Efficient Query Filtering for Streaming Times Series
Houston, Texas
November 27-November 30
ISBN: 0-7695-2278-5
Li Wei, University of California at Riverside
Eamonn Keogh, University of California at Riverside
Helga Van Herle, University of California at Los Angeles
Agenor Mafra-Neto, ISCA Technologies
In many applications it is desirable to monitor a streaming time series for predefined patterns. In domains as diverse as the monitoring of space telemetry, patient intensive care data, and insect populations, where data streams at a high rate and the number of predefined patterns is large, it may be impossible for the comparison algorithm to keep up. We propose a novel technique that exploits the commonality among the predefined patterns to allow monitoring at higher bandwidths, while maintaining a guarantee of no false dismissals. Our approach is based on the widely used envelope-based lower bounding technique. Extensive experiments demonstrate that our approach achieves tremendous improvements in performance in the offline case, and significant improvements in the fastest possible arrival rate of the data stream that can be processed with guaranteed no false dismissal.
Citation:
Li Wei, Eamonn Keogh, Helga Van Herle, Agenor Mafra-Neto, "Atomic Wedgie: Efficient Query Filtering for Streaming Times Series," icdm, pp.490-497, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.