Skip to main content

APCAS: An Approximate Approach to Adaptively Segment Time Series Stream

  • Conference paper
Advances in Data and Web Management (APWeb 2007, WAIM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4505))

Abstract

We study the problem of segmenting time series stream. Existing segmenting methods for time series mainly focus on the static data, and may be infeasible under the circumstance of time series stream. We propose an approximate method of APCAS(Adaptive Piecewise Constant Approximate Segmentation) to adaptively segment time series stream, which works in linear time. Extensive experiments, both on synthetic and real datasets, show that our approach is efficient and effective.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brian, B., Shivnath, B., Mayur, D., et al.: Models and Issues in Data Stream Systems. In: Proc. of 21st ACM Symposium on Principles of Database Systems, pp. 1–16. ACM, New York (2002)

    Google Scholar 

  2. Faloutsos, C., Jagadish, H., Mendelzon, A., et al.: A signaure technique for similarity-based queries. In: SEQUENCES 97, Pousitano-Salerno, Italy (1997)

    Google Scholar 

  3. Ingrid, S., Mathias, P., Bram, G.: Toward Automated Segmentation of the Pathological Lung in CT. IEEE Transactions on Medical Imaging 24(8), 1025–1038 (2005)

    Article  Google Scholar 

  4. Aiguo, L., Zheng, Q.: On-Line Segmentation of Time-Series Data. Journal of Software 15(11), 1671–1679 (2004)

    Google Scholar 

  5. Keogh, E., Chakrabarti, K., Pazzani, M.: Locally adaptive dimensionality reduction for indexing large time series databases. In: Proc. of ACM SIGMOD Conf. on Management of Data, pp. 151–162 (2001)

    Google Scholar 

  6. Keogh, E., Selina, C., David, H., et al.: An Online Algorithm for Segmenting Time Series. In: Intl’ Conf. of Data Mining, USA, pp. 289–296 (2001)

    Google Scholar 

  7. Keogh, E., Kasetty, S.: On the need for time series data mining benchmarks: a survey and empirical demonostration. In: The 8th ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, Edmonton, Canada, pp. 102–111 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Guozhu Dong Xuemin Lin Wei Wang Yun Yang Jeffrey Xu Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Junkui, L., Yuanzhen, W. (2007). APCAS: An Approximate Approach to Adaptively Segment Time Series Stream. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72524-4_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72483-4

  • Online ISBN: 978-3-540-72524-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics