276 search results - page 39 / 56 » PAC-Learning of Markov Models with Hidden State |
TIST
2011
13 years 1 months ago
2011
Recognition of chatting activities in social interactions is useful for constructing human social networks. However, the existence of multiple people involved in multiple dialogue...
BMCBI
2010
13 years 6 months ago
2010
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
EMNLP
2009
13 years 4 months ago
2009
We extend previous work on fully unsupervised part-of-speech tagging. Using a non-parametric version of the HMM, called the infinite HMM (iHMM), we address the problem of choosing...
ICML
2005
IEEE
14 years 7 months ago
2005
IEEE
For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optim...
IJCAI
1997
13 years 8 months ago
1997
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...