방법 비교

	베이즈 네트워크	방향성 비순환 그래프(DAG)를 이용한 인과 관계 식별(do-calculus)	마르코프 연쇄 몬테카를로 (MCMC)	구조방정식 모형
분야	베이지안	인과추론	베이지안	연구 통계
계열	Bayesian methods	Regression model	Bayesian methods	Process / pipeline
기원 연도	1988	2009	—	1921
창시자	Judea Pearl	Judea Pearl	—	Sewall Wright
유형	Probabilistic graphical model	Causal identification framework	Posterior sampling algorithm	Method
원전	Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann. ISBN: 978-1558604797	Pearl, J. (2009). Causality: Models, Reasoning, and Inference (2nd ed.). Cambridge University Press. ISBN: 978-0521895606	Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A. & Rubin, D. B. (2013). Bayesian Data Analysis (3rd ed.). CRC Press. ISBN: 978-1439840955	Jöreskog, K. G., & Sörbom, D. (1973). LISREL: A general computer program for estimating a linear structural equation system. Research Bulletin 73-5. University of Stockholm.
별칭	Bayes network, belief network, probabilistic graphical model, directed graphical model	do-calculus, backdoor adjustment, Pearl causal identification, DAG ile Nedensel Tanımlama (do-calculus)	markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo)	SEM, path analysis, latent variable modeling, causal modeling
관련	4	5	3	3
요약	A Bayesian network is a probabilistic graphical model, introduced by Judea Pearl in 1988, that encodes a set of variables and their conditional dependencies as a directed acyclic graph (DAG). Each node represents a variable; each directed edge encodes a direct probabilistic influence. By combining Bayes' rule with the graph's conditional independence structure, the model supports reasoning under uncertainty — computing the probability of any variable given observed evidence about others.	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.	Markov Chain Monte Carlo (MCMC) is a family of computational algorithms for sampling from complex probability distributions, most commonly the posterior distributions that arise in Bayesian inference. Rather than computing posteriors analytically — which is rarely possible for realistic models — MCMC constructs a Markov chain whose stationary distribution is the target posterior and draws dependent samples from it, enabling full probabilistic inference for virtually any model.	Structural equation modeling (SEM) is a comprehensive statistical framework combining path analysis (Sewall Wright, 1921) and confirmatory factor analysis to test complex causal models linking observed and latent variables. Formalized by Jöreskog (1973) with LISREL software, SEM enables simultaneous estimation of measurement relationships (how variables measure latent constructs) and structural relationships (how constructs influence outcomes), making it powerful for theory testing in psychology, epidemiology, organizational research, and health sciences where complex mediation, moderation, and latent processes require integrated analysis.