Fetching the paper…
Reading the bibliography…
In this paper we present a comprehensive view of prominent causal discovery algorithms, categorized into two main categories (1) assuming acyclic and no latent variables, and (2) allowing both cycles and latent variables, along with experimental results comparing them from three perspectives: (a) structural accuracy, (b) standard predictive accuracy, and (c) accuracy of counterfactual inference.
A. D. Wyner, “A definition of conditional mutual information for arbitrary ensembles,” Information and Control , vol. 38, no. 1, pp. 51–59, 1978
1978
Earlier work this paper cites.
G. Schwarz, “Estimating the dimension of a model the annals of statistics 6 (2), 461–464,” URL: http://dx. doi. org/10.1214/aos/1176344136 , 1978
1978
Earlier work this paper cites.
G. F. Cooper and E. Herskovits, “A bayesian method for the induction of probabilistic networks from data,” Machine learning , vol. 9, no. 4, pp. 309–347, 1992
1992
Earlier work this paper cites.
D. Dor and M. Tarsi, “A simple algorithm to construct a consistent extension of a partially oriented graph,” Technicial Report R-185, Cognitive Systems Laboratory, UCLA , 1992
1992
Earlier work this paper cites.
P. Spirtes, C. Meek, and T. Richardson, “Causal inference in the presence of latent variables and selection bias,” in Proceedings of the Eleventh conference on Uncertainty in artificial intelligence . Morgan Kaufmann Publishers Inc., 1995, pp. 499–506
1995
Earlier work this paper cites.
T. Richardson, “A discovery algorithm for directed cyclic graphs,” in Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence . Morgan Kaufmann Publishers Inc., 1996, pp. 454–461
1996
Earlier work this paper cites.
P. Spirtes, C. N. Glymour, and R. Scheines, Causation, prediction, and search . MIT press, 2000
2000
Earlier work this paper cites.
N. Friedman and D. Koller, “Being bayesian about network structure,” in Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence . Morgan Kaufmann Publishers Inc., 2000, pp. 201–210
2000
Earlier work this paper cites.
S. Tong and D. Koller, “Active learning for structure in bayesian networks,” in International joint conference on artificial intelligence , vol. 17, no. 1. LAWRENCE ERLBAUM ASSOCIATES LTD, 2001, pp. 863–869
2001
Earlier work this paper cites.
K. P. Murphy, “Active learning of causal bayes net structure,” 2001
2001
Earlier work this paper cites.
P. Spirtes, “An anytime algorithm for causal inference.” in AISTATS . Citeseer, 2001
2001
Earlier work this paper cites.
D. M. Chickering, “Learning equivalence classes of bayesian-network structures,” Journal of machine learning research , vol. 2, no. Feb, pp. 445–498, 2002
2002
Earlier work this paper cites.
D. M. Chickering, “Optimal structure identification with greedy search,” Journal of machine learning research , vol. 3, no. Nov, pp. 507–554, 2002
2002
Earlier work this paper cites.
J. Pearl, “Causality: models, reasoning and inference,” Econometric Theory , vol. 19, no. 675-685, p. 46, 2003
2003
Earlier work this paper cites.
S. Acid and L. M. de Campos, “Searching for bayesian network structures in the space of restricted acyclic partially directed graphs,” Journal of Artificial Intelligence Research , vol. 18, pp. 445–490, 2003
2003
Earlier work this paper cites.
P. Spirtes, C. Glymour, and R. Scheines, “The tetrad project: Causal models and statistical data. pittsburgh,” 2004
2004
Cited alongside, same era.
K. Sachs, O. Perez, D. Pe’er, D. A. Lauffenburger, and G. P. Nolan, “Causal protein-signaling networks derived from multiparameter single-cell data,” Science , vol. 308, no. 5721, pp. 523–529, 2005
2005
Cited alongside, same era.
I. Tsamardinos, L. E. Brown, and C. F. Aliferis, “The max-min hill-climbing bayesian network structure learning algorithm,” Machine learning , vol. 65, no. 1, pp. 31–78, 2006
2006
Cited alongside, same era.
J. M. Peña, “Learning gaussian graphical models of gene networks with false discovery rate control,” in European conference on evolutionary computation, machine learning and data mining in bioinformatics . Springer, 2008, pp. 165–176
2008
Cited alongside, same era.
A. Hauser and P. Bühlmann, “Characterization and greedy learning of interventional markov equivalence classes of directed acyclic graphs,” Journal of Machine Learning Research , vol. 13, no. Aug, pp. 2409–2464, 2012
2012
Later among the works it cites.
2012
Later among the works it cites.
M. Scutari, “bnlearn: Bayesian network structure learning, parameter learning and inference,” R package version , vol. 3, 2012
2012
Later among the works it cites.
S. Van de Geer, P. Bühlmann et al. , “l0 penalized maximum likelihood for sparse directed acyclic graphs,” The Annals of Statistics , vol. 41, no. 2, pp. 536–567, 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
M. Grzegorczyk, “An introduction to gaussian bayesian networks,” Systems Biology in Drug Discovery and Development: Methods and Protocols , pp. 121–147, 2010
2010
Cited alongside, same era.
M. H. Maathuis, D. Colombo, M. Kalisch, and P. Bühlmann, “Predicting causal effects in large-scale systems from observational data,” Nature Methods , vol. 7, no. 4, pp. 247–248, 2010
2010
Cited alongside, same era.
A. Greenfield, A. Madar, H. Ostrer, and R. Bonneau, “Dream4: Combining genetic and dynamic information to identify biological networks and dynamical models,” PloS one , vol. 5, no. 10, p. e13397, 2010
2010
Cited alongside, same era.
M. Kalisch, M. Mächler, and D. Colombo, “pcalg: Estimation of cpdag/pag and causal inference using the ida algorithm,” UR L http://CRAN. R-project. org/package= pcalg. R package version , pp. 1–1, 2010
2010
Cited alongside, same era.
A. Agresti and M. Kateri, Categorical data analysis . Springer, 2011
2011
Cited alongside, same era.
A. Mahmood, “Structure learning of causal bayesian networks: A survey,” 2011
2011
Cited alongside, same era.
2012
Cited alongside, same era.
A. Rau, F. Jaffrézic, and G. Nuel, “Joint estimation of causal effects from observational and intervention gene expression data,” BMC systems biology , vol. 7, no. 1, p. 111, 2013
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
2014
Later among the works it cites.
2015
Later among the works it cites.
A. Hauser and P. Bühlmann, “Jointly interventional and observational data: estimation of interventional markov equivalence classes of directed acyclic graphs,” Journal of the Royal Statistical Society: Series B (Statistical Methodology) , vol. 77, no. 1, pp. 291–318, 2015
2015
Later among the works it cites.
S. Yadav, G. Shroff, E. Hassan, and P. Agarwal, “Business data fusion,” in Information Fusion (Fusion), 2015 18th International Conference on . IEEE, 2015, pp. 1876–1885
2015
Later among the works it cites.
H. Cho, B. Berger, and J. Peng, “Reconstructing causal biological networks through active learning,” PloS one , vol. 11, no. 3, p. e0150611, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
M. H. Maathuis and P. Nandy, “A review of some recent advances in causal inference.” 2016
2016
Later among the works it cites.