Fetching the paper…
Reading the bibliography…
Causal discovery from observational data is pivotal for deciphering complex relationships.
P. Spirtes and C. Glymour, “An algorithm for fast recovery of sparse causal graphs,” Social science computer review , vol. 9, no. 1, pp. 62–72, 1991
1991
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, pp. 309–347, 1992
1992
Earlier work this paper cites.
D. Heckerman and D. Geiger, “Learning bayesian networks: a unification for discrete and gaussian domains,” in Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence , 1995, pp. 274–284
1995
Earlier work this paper cites.
D. M. Chickering, “Learning bayesian networks is np-complete,” Learning from data: Artificial intelligence and statistics V , pp. 121–130, 1996
1996
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.
R. T. O’Donnell, A. E. Nicholson, B. Han, K. B. Korb, M. J. Alam, and L. R. Hope, “Causal discovery with prior information,” in AI 2006: Advances in Artificial Intelligence: 19th Australian Joint Conference on Artificial Intelligence, Hobart, Australia, December 4-8, 2006. Proceedings 19 . Springer, 2006, pp. 1162–1167
2006
Earlier work this paper cites.
L. M. de Campos and J. G. Castellano, “Bayesian network learning algorithms using structural restrictions,” International Journal of Approximate Reasoning , vol. 45, no. 2, pp. 233–254, 2007
2007
Earlier work this paper cites.
B. Ellis and W. H. Wong, “Learning causal bayesian network structures from experimental data,” Journal of the American Statistical Association , vol. 103, no. 482, pp. 778–789, 2008
2008
Earlier work this paper cites.
P. Hoyer, D. Janzing, J. M. Mooij, J. Peters, and B. Schölkopf, “Nonlinear causal discovery with additive noise models,” Advances in neural information processing systems , vol. 21, 2008
2008
Earlier work this paper cites.
J. Pearl, Causality . Cambridge university press, 2009
2009
Earlier work this paper cites.
C. Yuan, B. Malone, and X. Wu, “Learning optimal bayesian networks using a* search,” in Twenty-second international joint conference on artificial intelligence , 2011
2011
Earlier work this paper cites.
J. A. Gámez, J. L. Mateo, and J. M. Puerta, “Learning bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood,” Data Mining and Knowledge Discovery , vol. 22, pp. 106–148, 2011
2011
Earlier work this paper cites.
A. A. Neath and J. E. Cavanaugh, “The bayesian information criterion: background, derivation, and applications,” Wiley Interdisciplinary Reviews: Computational Statistics , vol. 4, no. 2, pp. 199–203, 2012
2012
Cited alongside, same era.
2013
Cited alongside, same era.
S. L. Morgan and C. Winship, Counterfactuals and causal inference . Cambridge University Press, 2015
2015
Cited alongside, same era.
E. Y.-J. Chen, Y. Shen, A. Choi, and A. Darwiche, “Learning bayesian networks with ancestral constraints,” Advances in Neural Information Processing Systems , vol. 29, 2016
2016
Cited alongside, same era.
H. Amirkhani, M. Rahmati, P. J. Lucas, and A. Hommersom, “Exploiting experts’ knowledge for structure learning of bayesian networks,” IEEE transactions on pattern analysis and machine intelligence , vol. 39, no. 11, pp. 2154–2170, 2016
2022
Later among the works it cites.
N. K. Kitson, A. C. Constantinou, Z. Guo, Y. Liu, and K. Chobtham, “A survey of bayesian network structure learning,” Artificial Intelligence Review , pp. 1–94, 2023
2023
Closest in time.
A. C. Constantinou, Z. Guo, and N. K. Kitson, “The impact of prior knowledge on causal structure learning,” Knowledge and Information Systems , pp. 1–50, 2023
2023
Closest in time.
2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
C. Lee and P. van Beek, “Metaheuristics for score-and-search bayesian network structure learning,” in Advances in Artificial Intelligence: 30th Canadian Conference on Artificial Intelligence, Canadian AI 2017, Edmonton, AB, Canada, May 16-19, 2017, Proceedings 30 . Springer, 2017, pp. 129–141
2017
Cited alongside, same era.
E. V. Strobl, S. Visweswaran, and P. L. Spirtes, “Fast causal inference with non-random missingness by test-wise deletion,” International journal of data science and analytics , vol. 6, pp. 47–62, 2018
2018
Cited alongside, same era.
A. Li and P. Beek, “Bayesian network structure learning with side constraints,” in International Conference on Probabilistic Graphical Models . PMLR, 2018, pp. 225–236
2018
Cited alongside, same era.
M. Scutari, C. E. Graafland, and J. M. Gutiérrez, “Who learns better bayesian network structures: Accuracy and speed of structure learning algorithms,” International Journal of Approximate Reasoning , vol. 115, pp. 235–253, 2019
2019
Cited alongside, same era.
2021
Cited alongside, same era.
2021
Cited alongside, same era.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.