106 search results - page 17 / 22 » The max-min hill-climbing Bayesian network structure learnin... |
CIKM
1997
Springer
15 years 3 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
JMLR
2002
14 years 11 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
NN
2002
Springer
14 years 11 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...
129
Voted
PAMI
2011
14 years 6 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
ML
2008
ACM
14 years 11 months ago
2008
ACM
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...