25 search results - page 3 / 5 » Learning Bounded Treewidth Bayesian Networks |
NN
2002
Springer
13 years 5 months ago
2002
Springer
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
JMLR
2010
13 years 12 days ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
ICML
2009
IEEE
14 years 6 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
ICMLA
2007
13 years 7 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...