Segmenting time series with connected lines under maximum error bound

Information Sciences

Volumn 345, Issue , 2016, Pages 1-8

  Zhao, Huanyu ^a,b,c   Dong, Zhaowei ^d   Li, Tongliang ^b   Wang, Xizhao ^f   Pang, Chaoyi ^b,c,e  

^a SJZ JKSS Technology Co Ltd   (China)

^b INSTITUTE OF ENERGY RESOURCES   (China)

^c Zhejiang University   (China)

^d Radio and TV University   (China)

^e RMIT UNIVERSITY   (Australia)

^f SHENZHEN UNIVERSITY   (China)

Author keywords

Data compression; Haar wavelet; Piecewise linear Approximation representation; Time series data

Indexed keywords

CLUSTERING ALGORITHMS; ERRORS; PIECEWISE LINEAR TECHNIQUES; TIME SERIES;

APPROXIMATION ERRORS; CONNECTED LINES; HAAR WAVELETS; LINEAR-TIME ALGORITHMS; PIECEWISE LINEAR APPROXIMATIONS; SMOOTH APPROXIMATION; SYNTHETIC DATASETS; TIME-SERIES DATA;

DATA COMPRESSION;

EID: 84959361157     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2015.09.017     Document Type: Article

References (19)

1. U. Appel, and A.V. Brandt Adaptive sequential segmentation of piecewise stationary time series. Inf. Sci. 29 1 1983 27 56
2. E. Keogh, S. Chu, D. Hart, and M. Pazzani Segmenting time series: A survey and novel approach. Data Mining in Time Series Databases 2003 World Scientific 1 22
3. E. Keogh, X. Xi, L. Wei, C. Ratanamahatana, The UCR Time Series Classification/Clustering Homepage, 2006.
4. E.J. Keogh, M.J. Pazzani, Scaling up dynamic time warping to massive datasets, Principles of Data Mining and Knowledge Discovery, Lecture Notes in Computer Science, 17041999, pp. 1-11.
5. A. Koski, M. Juhola, and M. Meriste Syntactic recognition of ECG signals by attributed finite automata Pattern Recognit. 28 12 1995 1927 1940
6. X. Liu, Z. Lin, and H. Wang Novel online methods for time series segmentation IEEE Trans. Knowl. Data Eng. 20 12 2008 1616 1626
7. T. Palpanas, M. Vlachos, E. Keogh, and D. Gunopulos Streaming time series summarization using user-defined amnesic functions IEEE Trans. Knowl. Data Eng. 20 7 2008 992 1006
8. C. Pang, Q. Zhang, X. Zhou, D.P. Hansen, S. Wang, and A.J. Maeder Computing unrestricted synopses under maximum error bound Algorithmica 65 1 2013 1 42
9. J. Qi, R. Zhang, K. Ramamohanarao, H. Wang, Z. Wen, and D. Wu Indexable online time series segmentation with error bound guarantee World Wide Web 2013 1 43
10. D. Rafiei, and A. Mendelzon Efficient retrieval of similar time sequences using dft Proceedings of the 5th International Conference on Foundations of Data Organization and Algorithms (FODO), Kobe 1998 249 257
11. C. Perng, H. Wang, S.R. Zhang, and D.S. Parker Landmarks: a new model for similarity-based pattern querying in time series databases Proceedings of the 16th International Conference on Data Engineering(ICDE) 2000 33 42
12. Q. Xie, C. Pang, X. Zhou, X. Zhang, and K. Deng Maximum error-bounded piecewise linear representation for online stream approximation VLDB J. 2014 1 23
13. T. Palpanas, M. Vlachos, E. Keogh, D. Gunopulos, and W. Truppel Online amnesic approximation of streaming time series Proceeding of the 20th International Conference on Data Engineering 2004 339 349
14. R. Bellman On the approximation of curves by line segments using dynamic programming Commun. ACM 284 6 1961
15. B. Gluss Further remarks on line segment curve-fitting using dynamic programming Commun. ACM 5 8 1962 441 443
16. E. Keogh, S. Chu, D. Hart, and M. Pazzani An online algorithm for segmenting time series Proceedings of the 2001 IEEE International Conference on Data Mining 2001 289 296
17. G.M. Phillips Algorithms for piecewise straight line approximations Comput. J 11 2 1968 211 212
18. D.G. Wilson Piecewise linear approximations of fewest line segments Proceedings of the 1972 Spring Joint Computer Conference on AFIPS 40 1972 187 198
19. D.H. Douglas, and T.K. Peucker Algorithms for the reduction of the number of points required to represent a digitized line or its caricature Can. Cartogr. 10 2 1973 121 122