期刊
IEEE TRANSACTIONS ON CYBERNETICS
卷 51, 期 11, 页码 5409-5422出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2019.2962584
关键词
Time series analysis; Hidden Markov models; Clustering algorithms; Time measurement; Autoregressive processes; Data mining; Proposals; Data mining; feature extraction; segmentation; time-series clustering
类别
资金
- Spanish Ministry of Economy and Competitiveness
- FEDER funds (EU) [TIN2017-85887-C2-1-P, TIN2017-90567-REDT]
- FPU Predoctoral Program (Spanish Ministry of Education and Science) [FPU16/02128]
The proposed novel technique of time-series clustering involves two clustering stages that consider the similarity of different subsequences of each time series and use mapping to compare time-series objects. Results show promising performance, especially on larger datasets, when compared to three state-of-the-art methods on 84 datasets from the UCR Time Series Classification Archive.
Time-series clustering is the process of grouping time series with respect to their similarity or characteristics. Previous approaches usually combine a specific distance measure for time series and a standard clustering method. However, these approaches do not take the similarity of the different subsequences of each time series into account, which can be used to better compare the time-series objects of the dataset. In this article, we propose a novel technique of time-series clustering consisting of two clustering stages. In a first step, a least-squares polynomial segmentation procedure is applied to each time series, which is based on a growing window technique that returns different-length segments. Then, all of the segments are projected into the same dimensional space, based on the coefficients of the model that approximates the segment and a set of statistical features. After mapping, a first hierarchical clustering phase is applied to all mapped segments, returning groups of segments for each time series. These clusters are used to represent all time series in the same dimensional space, after defining another specific mapping process. In a second and final clustering stage, all the time-series objects are grouped. We consider internal clustering quality to automatically adjust the main parameter of the algorithm, which is an error threshold for the segmentation. The results obtained on 84 datasets from the UCR Time Series Classification Archive have been compared against three state-of-the-art methods, showing that the performance of this methodology is very promising, especially on larger datasets.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据