319 search results - page 7 / 64 » Learning Equivalence Classes of Bayesian Network Structures |
UAI
2003
14 years 10 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
76
Voted
JMLR
2010
14 years 4 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
NIPS
2008
14 years 11 months ago
2008
In this theoretical contribution we provide mathematical proof that two of the most important classes of network learning - correlation-based differential Hebbian learning and rew...
75
Voted
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
We introduce an expandable Bayesian network (EBN) to handle the combination of diverse multiple homogeneous evidence sets. An EBN is an augmented Bayesian network which instantiat...