Competing Hidden Markov Models on the Self-Organizing Map

13 years 9 months ago
Competing Hidden Markov Models on the Self-Organizing Map
This paper presents an unsupervised segmentation method for feature sequences based on competitivelearning hidden Markov models. Models associated with the nodes of the Self-Organizing Map learn to become selective to the segments of temporal input sequences. Input sequences may have arbitrary lengths. Segment models emerge then on the map through an unsupervised learning process. The method was tested in speech recognition, where the performance of the emergent segment models was as good as the performance of the traditionally used linguistic speech segment models. The benefits of the proposed method are the use of unsupervised learning for obtaining the state models for temporal data and the convenient visualization of the state space on the two-dimensional map.
Panu Somervuo
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 2000
Authors Panu Somervuo
Comments (0)