Clustering sequence data using hidden Markov model representation

Cen Li; Gautam Biswas

doi:10.1117/12.339979

Translator Disclaimer

25 February 1999 Clustering sequence data using hidden Markov model representation

Cen Li, Gautam Biswas

Author Affiliations +

Proceedings Volume 3695, Data Mining and Knowledge Discovery: Theory, Tools, and Technology; (1999) https://doi.org/10.1117/12.339979
Event: AeroSense '99, 1999, Orlando, FL, United States

Abstract

This paper proposes a clustering methodology, for sequence data, using hidden Markov model (HMM) representation. The proposed methodology improves upon existing HMM-based clustering methods in two ways: (i) it enables HMMs to dynamically change its model structure, to obtain a better fit model for data during the clustering process, and (ii) it provides objective criterion function, to select the optimal clustering partition. The algorithm is presented in terms of four nested levels of searches: (i) the search for the optimal number of clusters in a partition, (ii) the search for the optimal structure for a given partition, (iii) the search for the optimal HMM structure for each cluster, and (iv) the search for the optimal HMM parameters for each HMM. Preliminary results are given to support the proposed methodology.

Citation Download Citation

Cen Li and Gautam Biswas "Clustering sequence data using hidden Markov model representation", Proc. SPIE 3695, Data Mining and Knowledge Discovery: Theory, Tools, and Technology, (25 February 1999); https://doi.org/10.1117/12.339979

ACCESS THE FULL ARTICLE