Simultaneous optimisation of clustering quality and approximation error for time series segmentation
Journal: Information Sciences
Volume: 442
Pages: 186 - 201
Year: 2018
Impact Factor: JCR(2018): 5.524 Position: 9/155 (Q1) Category: COMPUTER SCIENCE, INFORMATION SYSTEMS
URL: https://www.sciencedirect.com/science/article/abs/pii/S0020025516313615?via%3DihubAbstract
Time series segmentation is aimed at representing a time series by using a set of segments. Some researchers perform segmentation by approximating each segment with a simple model (e.g. a linear interpolation), while others focus their efforts on obtaining homogeneous groups of segments, so that common patterns or behaviours can be detected. The main hypothesis of this paper is that both objectives are conflicting, so time series segmentation is proposed to be tackled from a multiobjective perspective, where both objectives are simultaneously considered, and the expert can choose the desired solution from a Pareto Front of different segmentations. A specific multiobjective evolutionary algorithm is designed for the purpose of deciding the cut points of the segments, integrating a clustering algorithm for fitness evaluation. The experimental validation of the methodology includes three synthetic time series and three time series from real-world problems. Nine clustering quality assessment metrics are experimentally compared to decide the most suitable one for the algorithm. The proposed algorithm shows good performance for both clustering quality and reconstruction error, improving the results of other mono-objective alternatives of the state-of-the-art and showing better results than a simple weighted linear combination of both corresponding fitness functions.
Citation
@article{duran2018simultaneous, title={Simultaneous optimisation of clustering quality and approximation error for time series segmentation}, author={Dur{\'a}n-Rosal, Antonio Manuel and Guti{\'e}rrez, Pedro Antonio and Mart{\'\i}nez-Estudillo, Francisco Jos{\'e} and H{\'e}rvas-Mart{\'\i}nez, C{\'e}sar}, journal={Information Sciences}, volume={442}, pages={186--201}, year={2018}, publisher={Elsevier} }