Skip to main content

Time Series Piecewise Linear Representation Based on Trend Feature Points

  • Conference paper
  • First Online:
Green Intelligent Transportation Systems (GITSS 2017)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 503))

Abstract

As local maximum and minimum can reflect the trend feature of subsequence, an approach of time series piecewise linear representation based on trend feature point is proposed. The points with large fluctuation can be extracted by judging the variation amplitude of slope. The results of the experiment show that the LMMS algorithm can meet the requirements of different compression ratios, and ensure small fitting error, stable performance, and good adaptability in time series datasets with low volatility. It has nice fitting effect in the volatile datasets under the low compression ratio condition. The relationship between the fitting error of piecewise linear representation algorithm with the whole fluctuation ratio of data and compression ratio is discussed. It can provide a certain reference for time series data mining effectively.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Keogh E, Smyth P (1997) A probabilistic approach to fast pattern matching in time series databases. Knowl Disc Databases 1997:24–30

    Google Scholar 

  2. Keogh E, Chu S, Hart D et al (2001) An online algorithm for segmenting time series, In: Proceedings of IEEE 13th international conference on data mining (ICDM), San Jose, CA, USA, pp 289–296

    Google Scholar 

  3. Lin J, Keogh E, Wei L et al (2007) Experiencing SAX: a novel symbolic representation of time series. Data Min Knowl Disc 15(2):107–144

    Article  MathSciNet  Google Scholar 

  4. Keogh E, Chakrabarti K, Pazzani M et al (2001) Dimensionality reduction for fast similarity search in large time series databases. Knowl Inf Syst 3(3):263–286

    Article  Google Scholar 

  5. Perng CS, Wang H, Zhang SR et al (2000) Landmarks: a new model for similarity-based pattern querying in time series databases. In: Proceedings IEEE 16th international conference on data engineering, San Diego, CA, USA, pp 33–42

    Google Scholar 

  6. Xiao H, Hu Y (2005) Data mining based on segmented time warping distance in time series database. J Comput Res Dev 42(1):72–78

    Article  Google Scholar 

  7. Zhan Y, Xu R, Chen X (2006) Time series piecewise linear representation based on slop extract edge point. Comput Sci 33(11):139–142

    Google Scholar 

  8. Jia PT, LIN W, He HC (2008) Adaptive piecewise linear representation of time series based on error restricted. Comput Eng Appl 44(5):10–13

    Google Scholar 

  9. Guerrero JL, Berlanga A, García J et al (2010) Piecewise linear representation segmentation as a multiobjective optimization problem, distributed computing and artificial intelligence. Springer, Berlin, pp 267–274

    Google Scholar 

  10. Charbonnier S, Damour D (2008) A robust auto-tuning on-line trend extraction method. Proc 17th IFAC World Congr 17(1):7288–7293

    Article  Google Scholar 

  11. Hu B, Rakthanmanon T, Hao Y et al (2014) Using the minimum description length to discover the intrinsic cardinality and dimensionality of time series. Data Min Knowl Discov 2014:1–42

    Google Scholar 

  12. Zhou Q, Wu TJ (2007) Trend feature extraction method based on important points in time series. J Zhejiang Univ (Eng Sci) 41(11):1782–1787

    Google Scholar 

  13. Yan CF, Fang JF, Wu LX et al (2013) An approach of time series piecewise linear representation based on local maximum minimum and extremum. J Inf Comput Sci 2013:2747–2756

    Article  Google Scholar 

  14. Dash S, Maurya MR, Venkatasubramanian V et al (2004) A novel interval-halving framework for automated identification of process trends. AIChE J 50(1):149–162

    Article  Google Scholar 

  15. Zhao H, Guo L-L, Zeng X-Y (2016) Evaluation of bus vibration comfort based on passenger crowdsourcing mode. Math Probl Eng 2016(2132454):10p

    Google Scholar 

Download references

Acknowledgements

This work was supported by the Natural Science Foundation of China under Grant No. 61262016, the Saier project of Chinese Education Ministry under Grant No. NGII20150615.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dong-Lin Ma .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ma, DL., Zhang, YL. (2019). Time Series Piecewise Linear Representation Based on Trend Feature Points. In: Wang, W., Bengler, K., Jiang, X. (eds) Green Intelligent Transportation Systems. GITSS 2017. Lecture Notes in Electrical Engineering, vol 503. Springer, Singapore. https://doi.org/10.1007/978-981-13-0302-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-0302-9_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-0301-2

  • Online ISBN: 978-981-13-0302-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics