Abstract
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable length sequences without requiring normalization of data. We show that the number of clusters governs the number of eigenvectors used to span the feature similarity space. We are thus able to automatically compute the optimal number of clusters. We successfully show that the proposed method accurately clusters variable length sequences for various scenarios.
Chapter PDF
References
Alon, J., Sclaroff, S., Kollios, G., Pavlovic, V.: Discovering clusters in motion timeseries data. In: Proceedings of Computer Vision and Pattern Recognition (2003)
Scott, G.L., Longuet-Higgins, H.C.: Feature grouping by relocalisation of eigenvectors of the proxmity matrix. In: Proc. British Machine Vision Conference, pp. 103–108 (1990)
Sleijpen, G., Van Der Vorst, H.: A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17, 401–425 (1996)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys (CSUR) 31(3), 264–323 (1999)
Shi, J., Malik, J.: Normalized cuts and image segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 731–737 (1997)
Rabiner, L.: A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of IEEE 77(2), 257–285 (1989)
Morgan, R.B.: Computing interior eigenvalues of large matrices. Linear Algebra Appl., 154/156, 289–309 (1991)
Smyth, P.: Clustering sequences with Hidden Markov Models. In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) Book: Advances in Neural Information Processing Systems, p. 648. The MIT Press, Cambridge (1997)
Weiss, Y.: Segmentation using eigenvectors: a unifying view. In: Proceedings IEEE International Conference on Computer Vision, pp. 975–982 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porikli, F. (2004). Clustering Variable Length Sequences by Eigenvector Decomposition Using HMM. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2004. Lecture Notes in Computer Science, vol 3138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27868-9_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-27868-9_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22570-6
Online ISBN: 978-3-540-27868-9
eBook Packages: Springer Book Archive