The Hierarchical Dirichlet Process Hidden Semi-Markov Model
Name
HDP-HSMM-conference.pdf
Size
424.95 KB
Format
Adobe PDF
Checksum (MD5)
19c1e3f560e6b8a5e9e9b253aca0d7f5
Author(s) •
Johnson, Matthew James
Willsky, Alan S
Date Issued
2010
Journal
Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)
Publisher
Association for Uncertainty in Artificial Intelligence (AUAI)
Citation
Matthew Johnson and Alan Willsky. "The Hierarchical Dirichlet Process Hidden Semi-Markov Model", Proceedings of the Twenty-Sixth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-10), AUAI Press (2010): 252-259.
Version
Author's final manuscript
Abstract
There is much interest in the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) as a natural Bayesian nonparametric extension of the traditional HMM. However, in many settings the HDP-HMM's strict Markovian constraints are undesirable, particularly if we wish to learn or encode non-geometric state durations. We can extend the HDP-HMM to capture such structure by drawing upon explicit-duration semi- Markovianity, which has been developed in the parametric setting to allow construction of highly interpretable models that admit natural prior information on state durations. In this paper we introduce the explicitduration HDP-HSMM and develop posterior sampling algorithms for efficient inference in both the direct-assignment and weak-limit approximation settings. We demonstrate the utility of the model and our inference methods on synthetic data as well as experiments on a speaker diarization problem and an example of learning the patterns in Morse code.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
http://event.cwi.nl/uai2010/papers/UAI2010_0193.pdf