A piecewise linear representation method based on importance data points for time series data

With the development of intelligent manufacturing technology, it can be foreseen that time series data generated by smart devices will raise to an unprecedented level. For time series with high amount, high dimension and renewal speed characteristics, resulting in difficult data mining and presentation on the original time series data. This paper presented a piecewise linear representation based on importance data points for time series data, which called PLR_IDP for short. The method finds importance data points by calculating the fitting error of single point and piecewise, and then represents time series approximately by linear composed of the importance data points. Results from theoretical analysis and experiments show that PLR_IDP reduces the dimensionality, holds the main characteristic with small fitting error of segments and single points.

[1]  Eamonn J. Keogh,et al.  Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases , 2001, Knowledge and Information Systems.

[2]  Heidrun Schumann,et al.  Visual Methods for Analyzing Time-Oriented Data , 2008, IEEE Transactions on Visualization and Computer Graphics.

[3]  W. Chu,et al.  Fast retrieval of similar subsequences in long sequence databases , 1999, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453).

[4]  Padhraic Smyth.  Clustering and Mode Classiication of Engineering Time Series Data , 2022 .

[5]  Xiaohu Yang,et al.  Radian-distance Based Time Series Similarity Measurement: Radian-distance Based Time Series Similarity Measurement , 2011 .

[6]  Yang Song.  Abnormity mining based on error and key-point in seismic precursory observation data , 2011 .

[7]  Hagit Shatkay,et al.  Approximate queries and representations for large data sequences , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[8]  Haixun Wang,et al.  Landmarks: a new model for similarity-based pattern querying in time series databases , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[9]  Carlos Agón,et al.  Time-series data mining , 2012, CSUR.

[10]  F. Attneave.  Some informational aspects of visual perception. , 1954, Psychological review.

[11]  Eamonn J. Keogh,et al.  An online algorithm for segmenting time series , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[12]  Eugene Fink,et al.  Search for Patterns in Compressed Time Series , 2002, Int. J. Image Graph..

[13]  Guo Chong-hui.  Survey of feature representations and similarity measurements in time series data mining , 2013 .

[14]  Li Min-qiang,et al.  Time Series Segmentation Based on Series Importance Point , 2008 .

[15]  Changzhou Wang,et al.  Supporting fast search in time series for movement patterns in multiple scales , 1998, CIKM '98.

[16]  Eamonn J. Keogh.  Fast similarity search in the presence of longitudinal scaling in time series databases , 1997, Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence.

[17]  Eamonn J. Keogh,et al.  A Probabilistic Approach to Fast Pattern Matching in Time Series Databases , 1997, KDD.

[18]  Tak-Chung Fu,et al.  A review on time series data mining , 2011, Eng. Appl. Artif. Intell..

[19]  Eamonn J. Keogh,et al.  An Enhanced Representation of Time Series Which Allows Fast and Accurate Classification, Clustering and Relevance Feedback , 1998, KDD.