ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
An HDP-HMM for systems with state persistence
Full text PdfPdf (857 KB)
Source ICML; Vol. 307 archive
Proceedings of the 25th international conference on Machine learning table of contents
Helsinki, Finland
Pages: 312-319  
Year of Publication: 2008
ISBN:978-1-60558-205-4
Authors
Emily B. Fox  Massachusetts Institute of Technology, Cambridge, MA
Erik B. Sudderth  University of California, Berkeley, CA
Michael I. Jordan  University of California, Berkeley, CA
Alan S. Willsky  Massachusetts Institute of Technology, Cambridge, MA
Sponsors
: Yahoo!
: Xerox
IBM : IBM
: NSF
Microsoft Research : Microsoft Research
: Machine Learning Journal/Springer
: Pascal
: University of Helsinki
: Federation of Finnish Learned Societies
: Intel Corporation
: Google
: Helsinki Institute for Information Technology
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 68,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1390156.1390196
What is a DOI?

ABSTRACT

The hierarchical Dirichlet process hidden Markov model (HDP-HMM) is a flexible, nonparametric model which allows state spaces of unknown size to be learned from data. We demonstrate some limitations of the original HDP-HMM formulation (Teh et al., 2006), and propose a sticky extension which allows more robust learning of smoothly varying dynamics. Using DP mixtures, this formulation also allows learning of more complex, multimodal emission distributions. We further develop a sampling algorithm that employs a truncated approximation of the DP to jointly resample the full state sequence, greatly improving mixing rates. Via extensive experiments with synthetic data and the NIST speaker diarization database, we demonstrate the advantages of our sticky extension, and the utility of the HDP-HMM in real-world applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Beal, M. J., Ghahramani, Z., & Rasmussen, C. E. (2002). The infinite hidden Markov model. NIPS (pp. 577--584).
2
 
3
Ishwaran, H., & Zarepour, M. (2002). Exact and approximate sum-representations for the Dirichlet process. Can. J. Stat., 30, 269--283.
 
4
Kivinen, J. J., Sudderth, E. B., & Jordan, M. I. (2007). Learning multiscale representations of natural scenes using Dirichlet processes. ICCV (pp. 1--8).
 
5
NIST (2007). Rich transcriptions database. http://www.nist.gov/speech/tests/rt/.
 
6
Rabiner, L. (1989). A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE, 77, 257--286.
 
7
Rodriguez, A., Dunson, D., & Gelfand, A. (2006). The nested Dirichlet process. Duke ISDS, TR #06--19.
 
8
Scott, S. (2002). Bayesian methods for hidden Markov models: Recursive computing in the 21st century. J. Amer. Stat. Assoc., 97, 337--351.
 
9
Sethuraman, J. (1994). A constructive definition of Dirichlet priors. Stat. Sinica, 4, 639--650.
 
10
Teh, Y. W., Jordan, M. I., Beal, M. J., & Blei, D. M. (2006). Hierarchical Dirichlet processes. J. Amer. Stat. Assoc., 101, 1566--1581.
 
11
Wooters, C., & Huijbregts, M. (2007). The ICSI RT07s speaker diarization system. To appear in LNCS.
 
12
Xing, E., & Sohn, K.-A. (2007). Hidden Markov Dirichlet process: Modeling genetic inference in open ancestral space. Bayes. Analysis, 2, 501--528.


Collaborative Colleagues:
Emily B. Fox: colleagues
Erik B. Sudderth: colleagues
Michael I. Jordan: colleagues
Alan S. Willsky: colleagues