Pawel Betlinski, Dominik Slezak. The Problem of Finding the Sparsest Bayesian Network for an Input Data Set is NP-Hard. In Li Chen, Alexander Felfernig, Jiming Liu, Zbigniew W. Ras, editors, Foundations of Intelligent Systems - 20th International Symposium, ISMIS 2012, Macau, China, December 4-7, 2012. Proceedings. Volume 7661 of Lecture Notes in Computer Science, pages 21-30, Springer, 2012. [doi]
@inproceedings{BetlinskiS12,
title = {The Problem of Finding the Sparsest Bayesian Network for an Input Data Set is NP-Hard},
author = {Pawel Betlinski and Dominik Slezak},
year = {2012},
doi = {10.1007/978-3-642-34624-8_3},
url = {http://dx.doi.org/10.1007/978-3-642-34624-8_3},
researchr = {https://researchr.org/publication/BetlinskiS12},
cites = {0},
citedby = {0},
pages = {21-30},
booktitle = {Foundations of Intelligent Systems - 20th International Symposium, ISMIS 2012, Macau, China, December 4-7, 2012. Proceedings},
editor = {Li Chen and Alexander Felfernig and Jiming Liu and Zbigniew W. Ras},
volume = {7661},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-34623-1},
}