Similarity-Based Clustering of Sequences Using Hidden Markov Models
- 24 June 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- HMM clustering for connected word recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Measuring HMM similarity with the Bayes probability of error and its application to online handwriting recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Hidden Markov Model-Based Approach to Sequential Data ClusteringLecture Notes in Computer Science, 2002
- Dissimilarity representations allow for building good classifiersPattern Recognition Letters, 2002
- Automatic pattern recognition by similarity representationsElectronics Letters, 2001
- Classification with nonmetric distances: image retrieval and class representationIeee Transactions On Pattern Analysis and Machine Intelligence, 2000
- 10.1162/15324430260185592Applied Physics Letters, 2000
- Representation and recognition of handwritten digits using deformable templatesIeee Transactions On Pattern Analysis and Machine Intelligence, 1997
- Context-independent phonetic hidden Markov models for speaker-independent continuous speech recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989