The Problem of Finding the Sparsest Bayesian Network for an Input Data Set is NP-Hard

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]

Abstract

Abstract is missing.