124 citations · 169 across the 2 of their papers we have counts for
2 papers
cs.AI2013★ 45 cited
An Algorithm for Finding Minimum d-Separating Sets in Belief Networks
Silvia Acid, Luis M. de Campos
The criterion commonly used in directed acyclic graphs (dags) for testing graphical independence is the well-known d-separation criterion. It allows us to build graphical represent…
cs.AI2011★ 124 cited
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
S. Acid, L. M. de Campos
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on ind…