384 search results - page 7 / 77 » Learning Markov Network Structure with Decision Trees |
ICML
1996
IEEE
14 years 8 months ago
1996
IEEE
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
ALT
2007
Springer
14 years 4 months ago
2007
Springer
We consider how state similarity in average reward Markov decision processes (MDPs) may be described by pseudometrics. Introducing the notion of adequate pseudometrics which are we...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
In modern automatic speech recognition systems, it is standard practice to cluster several logical hidden Markov model states into one physical, clustered state. Typically, the cl...
ALT
2010
Springer
13 years 9 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...