Fetching the paper…
Reading the bibliography…
It is known that from purely observational data, a causal DAG is identifiable only up to its Markov equivalence class, and for many ground truth DAGs, the direction of a large portion of the edges will be remained unidentified.
Accelerated greedy algorithms for maximizing submodular set functions
Michel Minoux · 1978
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions?i
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher · 1978
Earlier work this paper cites.
Exact methods for the knapsack problem and its generalizations
Krzysztof Dudziński and Stanisław Walukiewicz · 1987
Earlier work this paper cites.
Equivalence and synthesis of causal models
T Verma and Judea Pearl · 1990
Earlier work this paper cites.
Equivalence and synthesis of causal models
TS Verma Judea Pearl · 1991
Earlier work this paper cites.
An algorithm for deciding if a set of observed independencies has a causal explanation
Thomas Verma and Judea Pearl · 1992
Earlier work this paper cites.
Learning bayesian networks: The combination of knowledge and statistical data
David Heckerman, Dan Geiger, and David M Chickering · 1995
Earlier work this paper cites.
Causal inference and causal explanation with background knowledge
Christopher Meek · 1995
Earlier work this paper cites.
A theory of inferred causation
Judea Pearl and Thomas S Verma · 1995
Earlier work this paper cites.
Graphical models , volume 17
Steffen L Lauritzen · 1996
Earlier work this paper cites.
A characterization of Markov equivalence classes for acyclic digraphs
Steen A Andersson, David Madigan, and Michael D Perlman · 1997
Earlier work this paper cites.
Emergence of scaling in random networks
Albert-László Barabási and Réka Albert · 1999
Earlier work this paper cites.
Causation, prediction, and search
Peter Spirtes, Clark N Glymour, and Richard Scheines · 2000
Earlier work this paper cites.
Active learning for structure in bayesian networks
Simon Tong and Daphne Koller · 2001
Earlier work this paper cites.
Optimal structure identification with greedy search
David Maxwell Chickering · 2002
Earlier work this paper cites.
The size distribution for Markov equivalence classes of acyclic digraph models
Steven B Gillispie and Michael D Perlman · 2002
Cited alongside, same era.
Maximizing the spread of influence through a social network
David Kempe, Jon Kleinberg, and Éva Tardos · 2003
Cited alongside, same era.
Varieties of causal intervention
Kevin B Korb, Lucas R Hope, Ann E Nicholson, and Karl Axnick · 2004
Cited alongside, same era.
On the number of experiments sufficient and in the worst case necessary to identify all causal relations among n variables
Frederick Eberhardt, Clark Glymour, and Richard Scheines · 2005
Cited alongside, same era.
N-1 experiments suffice to determine the causal relations among n variables
Frederick Eberhardt, Clark Glymour, and Richard Scheines · 2006
Cited alongside, same era.
A linear non-gaussian acyclic model for causal discovery
Causality
Judea Pearl · 2009
Later among the works it cites.
On the identifiability of the post-nonlinear causal model
Kun Zhang and Aapo Hyvärinen · 2009
Later among the works it cites.
Almost optimal intervention sets for causal discovery
Frederick Eberhardt · 2012
Later among the works it cites.
Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
Alain Hauser and Peter Bühlmann · 2012
Later among the works it cites.
Experiment selection for causal discovery
Antti Hyttinen, Frederick Eberhardt, and Patrik O Hoyer · 2013
Later among the works it cites.
An interactive approach for bayesian network learning using domain/expert knowledge
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Shohei Shimizu, Patrik O Hoyer, Aapo Hyvärinen, and Antti Kerminen · 2006
Cited alongside, same era.
The max-min hill-climbing bayesian network structure learning algorithm
Ioannis Tsamardinos, Laura E Brown, and Constantin F Aliferis · 2006
Cited alongside, same era.
Causation and intervention
Frederick Eberhardt · 2007
Cited alongside, same era.
Interventions and causal inference
Frederick Eberhardt and Richard Scheines · 2007
Cited alongside, same era.
Cost-effective outbreak detection in networks
Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance · 2007
Cited alongside, same era.
Active learning of causal networks with intervention experiments and optimal designs
Yang-Bo He and Zhi Geng · 2008
Cited alongside, same era.
Efficient influence maximization in social networks
Wei Chen, Yajun Wang, and Siyu Yang · 2009
Cited alongside, same era.
Andrés R Masegosa and Serafín Moral · 2013
Later among the works it cites.
Causal inference and causal explanation with background knowledge
Christopher Meek · 2013
Later among the works it cites.
Two optimal strategies for active learning of causal models from interventional data
Alain Hauser and Peter Bühlmann · 2014
Later among the works it cites.
Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs
Yangbo He, Jinzhu Jia, and Bin Yu · 2015
Later among the works it cites.
Lazier than lazy greedy
Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, and Andreas Krause · 2015
Later among the works it cites.
Learning causal graphs with small interventions
Karthikeyan Shanmugam, Murat Kocaoglu, Alexandros G Dimakis, and Sriram Vishwanath · 2015
Later among the works it cites.
Network science
Albert-László Barabási · 2016
Later among the works it cites.
On sampling graphical Markov models
Megan Bernstein and Prasad Tetali · 2017
Later among the works it cites.
Experimental design for cost-aware learning of causal graphs
Erik Lindgren, Murat Kocaoglu, Alexandros G Dimakis, and Sriram Vishwanath · 2018
Later among the works it cites.
Characterizing and learning equivalence classes of causal dags under interventions
Karren D Yang, Abigail Katcoff, and Caroline Uhler · 2018
Later among the works it cites.