Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Algoritmi de Descoperire Cauzală (PC, FCI, LiNGAM)× | Identificarea cauzală cu grafuri aciclice direcționate (do-calculus)× | |
|---|---|---|
| Domeniu | Inferență cauzală | Inferență cauzală |
| Familie | Regression model | Regression model |
| Anul apariției≠ | 2000 | 2009 |
| Autorul original≠ | Spirtes, Glymour & Scheines (PC/FCI); Shimizu et al. (LiNGAM) | Judea Pearl |
| Tip≠ | Causal structure learning | Causal identification framework |
| Sursa seminală≠ | Spirtes, P., Glymour, C., & Scheines, R. (2000). Causation, Prediction, and Search (2nd ed.). MIT Press. ISBN: 978-0262194402 | Pearl, J. (2009). Causality: Models, Reasoning, and Inference (2nd ed.). Cambridge University Press. ISBN: 978-0521895606 |
| Denumiri alternative≠ | PC algorithm, FCI algorithm, LiNGAM, causal structure learning | do-calculus, backdoor adjustment, Pearl causal identification, DAG ile Nedensel Tanımlama (do-calculus) |
| Înrudite | 5 | 5 |
| Rezumat≠ | Causal discovery is a family of algorithms that automatically learn a directed acyclic graph (DAG) describing causal structure directly from observational data. The constraint-based PC and FCI algorithms were developed by Spirtes, Glymour and Scheines (2000), while the LiNGAM model of Shimizu et al. (2006) exploits linear non-Gaussian structure to orient edges. | DAG causal identification is a framework, developed by Judea Pearl (2009), that encodes causal assumptions as a directed acyclic graph and uses the do-calculus rules to determine whether and how a causal effect can be identified from observational data. It systematically handles confounders, instrumental variables, and backdoor paths. |
| ScholarGateSet de date ↗ |
|
|