220 search results - page 4 / 44 » Learning probabilistic decision graphs |
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
ICMLA
2009
13 years 5 months ago
2009
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
NIPS
2008
13 years 9 months ago
2008
We use graphical models and structure learning to explore how people learn policies in sequential decision making tasks. Studies of sequential decision-making in humans frequently...
UAI
2008
13 years 9 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...