作者: Jose M. Pena
DOI:
关键词:
摘要: We present a graphical criterion for reading dependencies from the minimal directed independence map G of graphoid p when is polytree and satisfies composition weak transitivity. prove that sound complete. argue assuming transitivity not too restrictive.