791 search results - page 52 / 159 » Learning Probabilistic Ontologies with Distributed Parameter... |
HRI
2007
ACM
14 years 21 days ago
2007
ACM
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
ALT
2011
Springer
12 years 8 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
We introduce confidence-weighted linear classifiers, which add parameter confidence information to linear classifiers. Online learners in this setting update both classifier param...
ALT
1999
Springer
14 years 1 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
ICML
2000
IEEE
14 years 9 months ago
2000
IEEE
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech t...