1018 search results - page 76 / 204 » Learning Probabilistic Models of Contours |
SSPR
2004
Springer
15 years 3 months ago
2004
Springer
We present a tutorial survey on some recent approaches to unsupervised machine learning in the context of statistical pattern recognition. In statistical PR, there are two classica...
NIPS
2007
14 years 11 months ago
2007
The learning of probabilistic models with many hidden variables and nondecomposable dependencies is an important and challenging problem. In contrast to traditional approaches bas...
AGI
2008
14 years 11 months ago
2008
Abstract. An artificial system that achieves human-level performance on opendomain tasks must have a huge amount of knowledge about the world. We argue that the most feasible way t...
UAI
2008
14 years 11 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
AAAI
2010
14 years 11 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...