116 citations · 267 across the 30 of their papers we have counts for
4 papers · 1 filter
On Local Optima in Learning Bayesian Networks
Jens D. Nielsen, Tomas Kocka, Jose M. Pena
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 it…
Identifying the Relevant Nodes Without Learning the Model
Jose M. Pena, Roland Nilsson, Johan Björkegren +1
We propose a method to identify all the nodes that are relevant to compute all the conditional probability distributions for a given set of nodes. Our method is simple, effcient, c…
Reading Dependencies from Polytree-Like Bayesian Networks
Jose M. Pena
We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak tra…
Learning AMP Chain Graphs under Faithfulness
Jose M. Peña
This paper deals with chain graphs under the alternative Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP…