Tech Report A Variational HEM Algorithm for Clustering Hidden Markov Models

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 1 figure

Scientific paper

The hidden Markov model (HMM) is a generative model that treats sequential data under the assumption that each observation is conditioned on the state of a discrete hidden variable that evolves in time as a Markov chain. In this paper, we derive a novel algorithm to cluster HMMs through their probability distributions. We propose a hierarchical EM algorithm that i) clusters a given collection of HMMs into groups of HMMs that are similar, in terms of the distributions they represent, and ii) characterizes each group by a "cluster center", i.e., a novel HMM that is representative for the group. We present several empirical studies that illustrate the benefits of the proposed algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Tech Report A Variational HEM Algorithm for Clustering Hidden Markov Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tech Report A Variational HEM Algorithm for Clustering Hidden Markov Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tech Report A Variational HEM Algorithm for Clustering Hidden Markov Models will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-92464

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.