Skip to main content

Piecewise Linear Representation Segmentation as a Multiobjective Optimization Problem

  • Conference paper
Distributed Computing and Artificial Intelligence

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 79))

Abstract

Actual time series exhibit huge amounts of data which require an unaffordable computational load to be processed, leading to approximate representations to aid these processes. Segmentation processes deal with this issue dividing time series into a certain number of segments and approximating those segments with a basic function. Among the most extended segmentation approaches, piecewise linear representation is highlighted due to its simplicity. This work presents an approach based on the formalization of the segmentation process as a multiobjetive optimization problem and the resolution of that problem with an evolutionary algorithm.

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 469.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 599.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. Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases. In: Proceeding of the 4th Conference of Data Organization and Algorithms, pp. 69–84 (1993)

    Google Scholar 

  2. Agrawal, R., Lin, K.I., Sawhey, H.S., Shim, K.: Fast similarity search in the presence of noise, scaling and translation in time-series databases. In: Proceedings of 21st International Conference on Very Large Databases, pp. 490–501 (1995)

    Google Scholar 

  3. Bleuler, S., Laumanns, M., Thiele, L., Zitzler, E.: PISA - A Platform and Programming Language Independent Interface for Search Algorithms. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 494–508. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Chan, K., Fu, W.: Efficient time series matching by wavelets. In: Proceedings of the 15th International Conference on Data Engineering, pp. 126–133 (1999)

    Google Scholar 

  5. Coello Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems, 2nd edn. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  6. Ehrgott, M.: Multicriteria optimizaction. In: Lecture Notes in Economics and Mathematical Systems, vol. 491, Springer, Heidelberg (2005)

    Google Scholar 

  7. Ge, X., Smyth, P.: Segmental Semi-Markov Models for Endpoint Detection in Plasma Etching. IEEE Trans. Semiconductor Engineering (2001)

    Google Scholar 

  8. Gionis, A., Mannila, H.: Segmentation algorithms for Time Series and Sequence Data. In: Tutorial in SIAM International Conference in Data Mining (2005)

    Google Scholar 

  9. Guerrero, J., Garcia, J.: Domain Transformation for Uniform Motion Identification in Air Traffic Trajectories. Advances in Soft Computing 50, 403–409 (2008)

    Article  Google Scholar 

  10. Keogh, E., et al.: Segmenting Time Series: A Survey and Novel Approach, 2nd edn. Data Mining in Time Series Databases, pp. 1–21. World Scientific, Singapore (2003)

    Google Scholar 

  11. Keogh, E., Pazzani, M.: An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. In: Proceedings of the 4th International Conference of Knowledge Discovery and Data Mining (1998)

    Google Scholar 

  12. Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases. Journal of Knowledge and Information Systems 3(3), 263–286 (2001)

    Article  MATH  Google Scholar 

  13. Koski, A., Juhola, M., Meriste, M.: Syntactic Recognition of ECG Signals by Attributed Finite Automata. Pattern Recognition 28(12), 1927–1940 (1995)

    Article  Google Scholar 

  14. Liefooghe, A., Jourdan, L., Talbi, E.-G.: A Unified Model for Evolutionary Multiobjective Optimization and its Implementation in a General Purpose Software Framework: ParadisEO-MOEO. Research Report RR-6906, INRIA (2009)

    Google Scholar 

  15. Liu, X., Lin, Z., Wang, H.: Novel Online Methods for Time Series Segmentation. IEEE Trans. on Knowledge and Data Engineering 20(12) (2008)

    Google Scholar 

  16. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Approach. In: EUROGEN 2001. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, pp. 95–100 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guerrero, J.L., Berlanga, A., García, J., Molina, J.M. (2010). Piecewise Linear Representation Segmentation as a Multiobjective Optimization Problem. In: de Leon F. de Carvalho, A.P., Rodríguez-González, S., De Paz Santana, J.F., Rodríguez, J.M.C. (eds) Distributed Computing and Artificial Intelligence. Advances in Intelligent and Soft Computing, vol 79. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14883-5_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14883-5_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14882-8

  • Online ISBN: 978-3-642-14883-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics