The Problem of Finding the Sparsest Bayesian Network for an Input Data Set is NP-Hard.
Pawel BetlinskiDominik SlezakPublished in: ISMIS (2012)
Keyphrases
- data sets
- np hard
- bayesian networks
- input data
- approximation algorithms
- special case
- greedy heuristic
- lower bound
- linear programming
- random variables
- real world
- learning bayesian networks
- influence diagrams
- incomplete data
- knapsack problem
- scheduling problem
- probabilistic model
- training data
- graphical models
- benchmark data sets
- training set
- minimum cost
- conditional independence
- structure learning
- probabilistic reasoning
- feature space
- computationally hard
- structural learning