← 返回卡片

原书出处

Causal AI

核验版本的摘录快照 · 导入于 2026-11-14T08:43:24.512Z

pgmpy also has a get_independencies method in the DAG class that enumerates minimal d-separating states that are true given a graph. Listing 4.2 Enumerating d-separations in pgmpy from pgmpy.base import DAG dag = DAG([ ('I', 'U'), ('I', 'M'), ('M', 'U'), ('J', 'V'), ('J', 'M'), ('M', 'V') ]) dag.get_independencies() #1 #1 Obtain all the minimal d-separation statements that are true in the ΔAG. The get_independencies method

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Causal AI/_epub-src/OEBPS/Text/chapter-4.xhtml

EPUB SHA-256:e55e7dc9d7966ea79311f2bc8d5bef7371a6dbb65240f11a2b3e44180b934e72