D-separation
d-Separation is a formal criterion in causal graphical models that determines whether a set of variables is conditionally independent of another set given a third, by assessing the absence of active paths between them under a defined set of graphical blocking rules.
61
Publications
3.4K
Citations
106
Authors
68
Institutions
Publications per year
2017–2026
12
Parents
61
Identifying independence in bayesian networks
Dan Geiger, Thomas Verma, Judea Pearl · Networks · 1990 · 526 citations
1–5 of 61
106
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 106
68
Tongji University
Shanghai, China
4 h-index
2 publications
48 citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
6 publications
1.8K citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
3 publications
241 citations
Fudan University
Shanghai, China
3 h-index
3 publications
66 citations

University of Calgary
Calgary, Canada
2 h-index
1 publications
22 citations

Université de Sherbrooke
Sherbrooke, Canada
2 h-index
2 publications
633 citations
University of Science and Technology of China
Hefei, China
2 h-index
2 publications
25 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
50 citations
1–8 of 68
Repository · 15 publications · 651 citations
12
h-index
Conference · 3 publications · 54 citations
4
h-index
NJP · 3 publications · 238 citations
3
h-index
SEM · 3 publications · 159 citations
3
h-index
Repository · 2 publications · 35 citations
2
h-index
1–5