Resource Adaptive Periodicity Estimation of Streaming Data

  • Michail Vlachos
  • Deepak S. Turaga
  • Philip S. Yu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3896)

Abstract

Streaming environments typically dictate incomplete or approximate algorithm execution, in order to cope with sudden surges in the data rate. Such limitations are even more accentuated in mobile environments (such as sensor networks) where computational and memory resources are typically limited. This paper introduces the first “resource adaptive” algorithm for periodicity estimation on a continuous stream of data. Our formulation is based on the derivation of a closed-form incremental computation of the spectrum, augmented by an intelligent load-shedding scheme that can adapt to available CPU resources. Our experiments indicate that the proposed technique can be a viable and resource efficient solution for real-time spectrum estimation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Broomhead, D., Lowe, D.: Multivariate functional interpolation and adaptive networks. Complex Systems 2, 321–355 (1988)MATHMathSciNetGoogle Scholar
  2. 2.
    Castiglioni, P., Rienzo, M., Yosh, H.: A Computationally Efficient Algorithm for Online Spectral Analysis of Beat-to-Beat Signals. Computers in Cardiology 29, 417–420 (2002)Google Scholar
  3. 3.
    Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput 19, 297–301 (1965)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Cuadra, P., Master, A., Sapp, C.: Efficient Pitch Detection Techniques for Interactive Music. In: International Computer Music Conference (2001)Google Scholar
  5. 5.
    Elfeky, M.G., Aref, W.G., Elmagarmid, A.K.: Using convolution to mine obscure periodic patterns in one pass. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 605–620. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    Ergün, F., Muthukrishnan, S.M., Sahinalp, S.C.: Sublinear methods for detecting periodic trends in data streams. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 16–28. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Fan, W.: StreamMiner: A Classifier Ensemble-based Engine to Mine Conceptdrifting Data Streams. In: Proc. of VLDB, pp. 1257–1260 (2004)Google Scholar
  8. 8.
    Gilbert, A.C., Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Near-optimal Sparse Fourier Representations via Sampling. In: STOC, pp. 152–161 (2002)Google Scholar
  9. 9.
    Kontaki, M., Papadopoulos, A.: Efficient similarity search in streaming time sequences. In: SSDBM (2004)Google Scholar
  10. 10.
    Lazarescu, M., Venkatesh, S., Bui, H.H.: Using Multiple Windows to Track Concept Drift. Intelligent Data Analysis Journal 8(1) (2004)Google Scholar
  11. 11.
    Papadimitriou, S., Brockwell, A., Faloutsos, C.: Awsom: Adaptive, hands-off stream mining. In: VLDB, pp. 560–571 (2003)Google Scholar
  12. 12.
    Papoulis, A.: Signal Analysis. McGraw-Hill, New York (1977)MATHGoogle Scholar
  13. 13.
    Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes: The Art of Scientific Computing. Cambridge University Press, Cambridge (1992)Google Scholar
  14. 14.
    Time-Series Data Mining Archive, http://www.cs.ucr.edu/eamonn/TSDMA/
  15. 15.
    Zhu, Y., Shasha, D.: Statstream: Statistical monitoring of thousands of data streams in real time. In: VLDB (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michail Vlachos
    • 1
  • Deepak S. Turaga
    • 1
  • Philip S. Yu
    • 1
  1. 1.IBM T.J. Watson Research CenterHawthorne

Personalised recommendations