ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Identification causale avec les graphes acycliques dirigés (do-calculus)×Chaîne de Markov Monte Carlo (MCMC)×
DomaineInférence causaleBayésien
FamilleRegression modelBayesian methods
Année d'origine2009
Auteur d'origineJudea Pearl
TypeCausal identification frameworkPosterior sampling algorithm
Source fondatricePearl, J. (2009). Causality: Models, Reasoning, and Inference (2nd ed.). Cambridge University Press. ISBN: 978-0521895606Gelman, 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
Aliasdo-calculus, backdoor adjustment, Pearl causal identification, DAG ile Nedensel Tanımlama (do-calculus)markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo)
Apparentées53
Résumé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.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: DAG Causal Identification · MCMC. Consulté le 2026-06-17 sur https://scholargate.app/fr/compare