BriefGPT.xyz
Feb, 2013
信念网络中寻找最小d-分离集的算法
An Algorithm for Finding Minimum d-Separating Sets in Belief Networks
HTML
PDF
Silvia Acid, Luis M. de Campos
TL;DR
该研究讨论了在有向无环图中查找最小分隔集的组合问题和其扩展，提出了一种基于两步过程的算法来解决该问题。
Abstract
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 representations of
→