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/ko/compare