An Alternative Proof That Exact Inference Problem in Bayesian Belief Networks Is NP-Hard.
Mustafa TacettinTonguç ÜnlüyurtPublished in: ISCIS (2005)
Keyphrases
- similarity measure
- bayesian belief networks
- exact inference
- belief networks
- probabilistic inference
- np hard
- bayesian networks
- graphical models
- approximate inference
- approximation algorithms
- conditional probabilities
- probability distribution
- belief propagation
- special case
- optimal solution
- probabilistic model
- lower bound
- computational complexity
- multilayer perceptron
- image sequences
- junction tree
- structured prediction
- efficient learning
- structure learning
- message passing
- conditional random fields
- random variables
- worst case
- reinforcement learning