Atomic wedgie: Efficient query filtering for streaming time series

54Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2005 IEEE.

Cite

CITATION STYLE

APA

Li, W., Keogh, E., Van Herle, H., & Mafra-Neto, A. (2005). Atomic wedgie: Efficient query filtering for streaming time series. In Proceedings - IEEE International Conference on Data Mining, ICDM (pp. 490–497). https://doi.org/10.1109/ICDM.2005.28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free