# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### The Infinite Hidden Markov Model

##### Locator

There are no locators available

##### Fulltext (public)

There are no public fulltexts available

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Beal, M., Ghahramani, Z., & Rasmussen, C. (2002). The Infinite Hidden Markov Model.* Advances in Neural Information Processing Systems 14,* 577-584.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-DF16-D

##### Abstract

We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integrate out the infinitely many transition parameters, leaving only three hyperparameters which can be learned from data. These three hyperparameters define a hierarchical Dirichlet process capable of capturing a rich set of transition dynamics. The three hyperparameters control the time scale of the dynamics, the sparsity of the underlying state-transition matrix, and the expected number of distinct hidden states in a finite sequence. In this framework it is also natural to allow the alphabet of emitted symbols to be infinite - consider, for example, symbols being possible words appearing in English text.