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.

Keywords

Hide Markov Model Gaussian Mixture Model Cluster Number Validity Score Output Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Alon, J., Sclaroff, S., Kollios, G., Pavlovic, V.: Discovering clusters in motion timeseries data. In: Proceedings of Computer Vision and Pattern Recognition (2003)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Sleijpen, G., Van Der Vorst, H.: A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17, 401–425 (1996)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys (CSUR) 31(3), 264–323 (1999)CrossRefGoogle Scholar
  5. 5.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 731–737 (1997)Google Scholar
  6. 6.
    Rabiner, L.: A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of IEEE 77(2), 257–285 (1989)CrossRefGoogle Scholar
  7. 7.
    Morgan, R.B.: Computing interior eigenvalues of large matrices. Linear Algebra Appl., 154/156, 289–309 (1991)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Weiss, Y.: Segmentation using eigenvectors: a unifying view. In: Proceedings IEEE International Conference on Computer Vision, pp. 975–982 (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Fatih Porikli
    • 1
  1. 1.Mitsubishi Electric Research LaboratoriesCambridgeUSA

Personalised recommendations