1014 search results - page 140 / 203 » A Spectral Algorithm for Learning Hidden Markov Models |
EMNLP
2009
13 years 5 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...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
This paper concerns the problem of agent trust in an electronic market place. We maintain that agent trust involves making decisions under uncertainty and therefore the phenomenon...
INTERSPEECH
2010
13 years 2 months ago
2010
Practical supervised learning scenarios involving subjectively evaluated data have multiple evaluators, each giving their noisy version of the hidden ground truth. Majority logic ...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
AAAI
2007
13 years 10 months ago
2007
Sparsity-promoting L1-regularization has recently been succesfully used to learn the structure of undirected graphical models. In this paper, we apply this technique to learn the ...