The problem of finding the sparsest bayesian network for an input data set is NP-Hard

  • Authors:
  • Paweł Betliński;Dominik Ślęzak

  • Affiliations:
  • Institute of Mathematics, University of Warsaw, Warsaw, Poland;Institute of Mathematics, University of Warsaw, Warsaw, Poland, Infobright Inc., Warsaw, Poland

  • Venue:
  • ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that the problem of finding a Bayesian network with minimum number of edges for an input data set is NP-hard. We discuss the analogies of formulation and proof of our result to other studies in the areas of Bayesian networks and knowledge discovery.