By Topic

An algorithm to determine hidden Markov model topology

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
R. C. Vasko ; Dept. of Electr. Eng., Pittsburgh Univ., PA, USA ; A. El-Jaroudi ; J. R. Boston

Hidden Markov modeling (HMM) provides a probabilistic framework for modeling a time series of multivariate observations. An HMM describes the dynamic behavior of the observations in terms of movement among the states of a finite-state machine. We present an algorithm that selects an HMM topology for a set of time series data. Our method selects a topology based on a likelihood criterion and a heuristic evaluation of complexity. The algorithm iteratively prunes state transitions from a large general HMM topology until a topology is obtained that concisely represents the dynamic structure of the data. The goal of this approach is to allow the data to reveal their own dynamic structure without external assumptions concerning the number of states or pattern of transitions

Published in:

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on  (Volume:6 )

Date of Conference:

7-10 May 1996