Spectral clustering for time series

Authors:
Fei Wang;Changshui Zhang
Affiliations:
State Key Laboratory of Intelligent Technology and Systems, Department of Automation, Tsinghua University, Beijing, P.R. China;State Key Laboratory of Intelligent Technology and Systems, Department of Automation, Tsinghua University, Beijing, P.R. China
Venue:
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
Year:
2005

Citing 7
Cited 0

Efficient Similarity Search In Sequence Databases

FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Finding Similar Time Series

PKDD '97 Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery
A Hidden Markov Model-Based Approach to Sequential Data Clustering

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
A unified framework for model-based clustering

The Journal of Machine Learning Research
Kernel subspace LDA with optimized kernel parameters on face recognition

FGR' 04 Proceedings of the Sixth IEEE international conference on Automatic face and gesture recognition
Boosting GMM and its two applications

MCS'05 Proceedings of the 6th international conference on Multiple Classifier Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a general framework for time series clustering based on spectral decomposition of the affinity matrix. We use the Gaussian function to construct the affinity matrix and develop a gradient based method for self-tuning the variance of the Gaussian function. The feasibility of our method is guaranteed by the theoretical inference in this paper. And our approach can be used to cluster both constant and variable length time series. Further our analysis shows that the cluster number is governed by the eigenstructure of the normalized affinity matrix. Thus our algorithm is able to discover the optimal number of clusters automatically. Finally experimental results are presented to show the effectiveness of our method.