ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Algoritmi de Descoperire Cauzală (PC, FCI, LiNGAM)×Designul de discontinuitate a regresiei (RDD)×
DomeniuInferență cauzalăInferență cauzală
FamilieRegression modelRegression model
Anul apariției20002008
Autorul originalSpirtes, Glymour & Scheines (PC/FCI); Shimizu et al. (LiNGAM)Imbens & Lemieux (guide to practice); Cattaneo, Idrobo & Titiunik (practical introduction)
TipCausal structure learningQuasi-experimental causal design
Sursa seminalăSpirtes, P., Glymour, C., & Scheines, R. (2000). Causation, Prediction, and Search (2nd ed.). MIT Press. ISBN: 978-0262194402Imbens, G. W., & Lemieux, T. (2008). Regression Discontinuity Designs: A Guide to Practice. Journal of Econometrics, 142(2), 615-635. DOI ↗
Denumiri alternativePC algorithm, FCI algorithm, LiNGAM, causal structure learningRDD, regression discontinuity design, sharp RDD, fuzzy RDD
Înrudite55
RezumatCausal 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.Regression Discontinuity Design is a quasi-experimental method that identifies a causal effect by locally comparing units just above and just below a cutoff on a continuous assignment (running) variable. Formalised for applied work by Imbens and Lemieux (2008) and developed as a practical framework by Cattaneo, Idrobo, and Titiunik (2020), it estimates a local average treatment effect (LATE) at the threshold.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Causal Discovery Algorithms · Regression Discontinuity. Preluat la 2026-06-20 de pe https://scholargate.app/ro/compare