ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

אלגוריתמים לגילוי סיבתי (PC, FCI, LiNGAM)×התאמת ציון נטייה×
תחוםהסקה סיבתיתסטטיסטיקה למחקר
משפחהRegression modelProcess / pipeline
שנת המקור20001983
הוגה השיטהSpirtes, Glymour & Scheines (PC/FCI); Shimizu et al. (LiNGAM)Paul Rosenbaum and Donald Rubin
סוגCausal structure learningMethod
מקור מכונןSpirtes, P., Glymour, C., & Scheines, R. (2000). Causation, Prediction, and Search (2nd ed.). MIT Press. ISBN: 978-0262194402Rosenbaum, P. R., & Rubin, D. B. (1983). The central role of the propensity score in observational studies for causal effects. Biometrika, 70(1), 41–55. DOI ↗
כינוייםPC algorithm, FCI algorithm, LiNGAM, causal structure learningPSM, propensity score weighting, covariate balance
קשורות53
תקציר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.Propensity score matching (PSM) is a method for reducing confounding bias in observational studies by balancing baseline characteristics between treatment groups, simulating randomization. Developed by Rosenbaum and Rubin (1983), it estimates the probability of receiving treatment given observed covariates, then matches or weights treated and control individuals with similar treatment probabilities. Widely used in medicine, epidemiology, and policy evaluation when randomized trials are infeasible or unethical, enabling estimation of treatment effects while controlling for selection bias.
ScholarGateמערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 3 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Causal Discovery Algorithms · Propensity Score Matching. אוחזר בתאריך 2026-06-18 מתוך https://scholargate.app/he/compare