A new approach for optimal time-series segmentation

Abstract Emerging technologies have led to the creation of huge databases that require reducing their high dimensionality to be analysed. Many suboptimal methods have been proposed for this purpose. On the other hand, few efficient optimal methods have been proposed due to their high computational complexity. However, these methods are necessary to evaluate the performance of suboptimal methods. This paper proposes a new optimal approach, called OSTS, to improve the segmentation of time series. The proposed method is based on A* algorithm and it uses an improved version of the well-known Salotti method for obtaining optimal polygonal approximations. Firstly, a suboptimal method for time-series segmentation is applied to obtain pruning values. In this case, a suboptimal method based on Bottom-Up technique is selected. Then, the results of the suboptimal method are used as pruning values to reduce the computational time of the proposed method. The proposal has been compared to other suboptimal methods and the results have shown that the method is optimal, and, in some cases, the computational time is similar to other suboptimal methods.

[1]  Li Wei,et al.  Experiencing SAX: a novel symbolic representation of time series , 2007, Data Mining and Knowledge Discovery.

[2]  Pedro Antonio Gutiérrez,et al.  A statistically-driven Coral Reef Optimization algorithm for optimal size reduction of time series , 2018, Appl. Soft Comput..

[3]  Bernhard Sick,et al.  Online Segmentation of Time Series Based on Polynomial Least-Squares Approximations , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  James Kennedy,et al.  Bare bones particle swarms , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[5]  Ying Wah Teh,et al.  Time-series clustering - A decade review , 2015, Inf. Syst..

[6]  Eamonn J. Keogh,et al.  Segmenting Time Series: A Survey and Novel Approach , 2002 .

[7]  Pedro Antonio Gutiérrez,et al.  A hybrid dynamic exploitation barebones particle swarm optimisation algorithm for time series segmentation , 2019, Neurocomputing.

[8]  G. F. Bryant,et al.  A new algorithm for segmenting data from time series , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[9]  Iqbal H. Sarker,et al.  RecencyMiner: mining recency-based personalized behavior from contextual smartphone data , 2019, Journal of Big Data.

[10]  I. Johnstone,et al.  Ideal spatial adaptation by wavelet shrinkage , 1994 .

[11]  Iqbal H. Sarker.  Context-aware rule learning from smartphone data: survey, challenges and future directions , 2019, Journal of Big Data.

[12]  Pedro Antonio Gutiérrez,et al.  Time Series Representation by a Novel Hybrid Segmentation Algorithm , 2016, HAIS.

[13]  Ruzena Bajcsy,et al.  Segmentation versus object representation—are they separable? , 1989 .

[14]  Anil K. Jain,et al.  Analysis and Interpretation of Range Images , 1989, Springer Series in Perception Engineering.

[15]  Ángel Carmona Poyato,et al.  New method for obtaining optimal polygonal approximations to solve the min-$$\varepsilon$$ε problem , 2016, Neural Computing and Applications.

[16]  Laurent Itti,et al.  Classifying Time Series Using Local Descriptors with Hybrid Sampling , 2016, IEEE Transactions on Knowledge and Data Engineering.

[17]  I. Johnstone,et al.  Adapting to Unknown Smoothness via Wavelet Shrinkage , 1995 .

[18]  Liang Zhao,et al.  Time series clustering via community detection in networks , 2015, Inf. Sci..

[19]  Pedro Antonio Gutiérrez,et al.  Detection of early warning signals in paleoclimate data using a genetic time series segmentation algorithm , 2015, Climate Dynamics.

[20]  Its'hak Dinstein,et al.  Optimal polygonal approximation of digital curves , 1995, Pattern Recognit..

[21]  Geeta Sikka,et al.  Recent Techniques of Clustering of Time Series Data: A Survey , 2012 .

[22]  Abbas Ahmadi,et al.  A shape-based adaptive segmentation of time-series using particle swarm optimization , 2017, Inf. Syst..

[23]  G.B. Moody,et al.  The impact of the MIT-BIH Arrhythmia Database , 2001, IEEE Engineering in Medicine and Biology Magazine.

[24]  Aurora González-Vidal,et al.  BEATS: Blocks of Eigenvalues Algorithm for Time Series Segmentation , 2018, IEEE Transactions on Knowledge and Data Engineering.

[25]  Asif Masood,et al.  Optimized polygonal approximation by dominant point deletion , 2008, Pattern Recognit..

[26]  Marc Salotti,et al.  Optimal polygonal approximation of digitized curves using the sum of square deviations criterion , 2002, Pattern Recognit..

[27]  Iqbal H. Sarker,et al.  Individualized Time-Series Segmentation for Mining Mobile Phone User Behavior , 2018, Comput. J..