Orthogonal feature learning for time series clustering

• Authors: Xiaozhe Wang;Leo Lopes
• Venue: ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part II
• Year: 2011

This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or features extracted from the data are used as input for various clustering or classification algorithms. Our methods use features extraction to represent a time series by a fixed-dimensional vector whose components are statistical metrics. Each metric is a specific feature based on the global structure of the time series data given. However, if there are correlations between feature metrics, it could result in clustering in a distorted space. To address this, we propose to orthogonalize the space of metrics using linear correlation information to reduce the impact on the clustering from the correlations between clustering inputs. We demonstrate the orthogonal feature learning on two popular clustering algorithms, k-means and hierarchical clustering. Two benchmarking data sets are used in the experiments. The empirical results shows that our proposed orthogonal feature learning method gives a better clustering accuracy compared to all other approaches including: exhaustive feature search, without feature optimization or selection, and without feature extraction for clustering. We expect our method to enhance the feature extraction process which also serves as an improved dimension reduction resolution for time series clustering and classification.