13 citations · 13 across the 2 of their papers we have counts for
2 papers
cs.AI2012
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…
stat.ML2012★ 13 cited
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…