Empirical Hardness of Finding Optimal Bayesian Network Structures: Algorithm Selection and Runtime Prediction

Cite

Text

Malone et al. "Empirical Hardness of Finding Optimal Bayesian Network Structures: Algorithm Selection and Runtime Prediction." Machine Learning, 2018. doi:10.1007/S10994-017-5680-2

Markdown

[Malone et al. "Empirical Hardness of Finding Optimal Bayesian Network Structures: Algorithm Selection and Runtime Prediction." Machine Learning, 2018.](https://mlanthology.org/mlj/2018/malone2018mlj-empirical/) doi:10.1007/S10994-017-5680-2

BibTeX

@article{malone2018mlj-empirical,
  title     = {{Empirical Hardness of Finding Optimal Bayesian Network Structures: Algorithm Selection and Runtime Prediction}},
  author    = {Malone, Brandon M. and Kangas, Kustaa and Järvisalo, Matti and Koivisto, Mikko and Myllymäki, Petri},
  journal   = {Machine Learning},
  year      = {2018},
  pages     = {247-283},
  doi       = {10.1007/S10994-017-5680-2},
  volume    = {107},
  url       = {https://mlanthology.org/mlj/2018/malone2018mlj-empirical/}
}