Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables

4 July 2012

Papers citing "Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables"

9 / 9 papers shown

Title
Characterization and Learning of Causal Graphs from Hard Interventions Zihan Zhou Muhammad Qasim Elahi Murat Kocaoglu CML 128 0 0 02 May 2025
Constraint-Based Causal Discovery using Partial Ancestral Graphs in the presence of Cycles Joris M. Mooij Tom Claassen 88 42 0 01 May 2020
Learning and Testing Causal Models with Interventions Jayadev Acharya Arnab Bhattacharyya C. Daskalakis S. Kandasamy CML 61 53 0 24 May 2018
Interpreting and using CPDAGs with background knowledge Emilija Perković M. Kalisch Marloes H. Maathuis 75 52 0 07 Jul 2017
A generalized back-door criterion Marloes H. Maathuis Diego Colombo 107 36 0 22 Jul 2013
A Transformational Characterization of Markov Equivalence for Directed Acyclic Graphs with Latent Variables Jiji Zhang Peter Spirtes 101 29 0 04 Jul 2012
Maximum likelihood fitting of acyclic directed mixed graphs to binary data R. Evans Thomas S. Richardson 100 25 0 15 Mar 2012
A Logical Characterization of Constraint-Based Causal Discovery Tom Claassen Tom Heskes CML 129 39 0 14 Feb 2012
Markov Equivalences for Subclasses of Loopless Mixed Graphs Kayvan Sadeghi 52 8 0 20 Oct 2011