Reduction of Computational Complexity in Bayesian Networks through Removal of Weak Dependencies
Uffe KjærulffPublished in: CoRR (2013)
Keyphrases
- bayesian networks
- computational complexity
- high computational complexity
- conditional independence
- special case
- complexity reduction
- np complete
- learning bayesian networks
- graphical models
- incomplete data
- probabilistic reasoning
- memory requirements
- computational efficiency
- random variables
- np hard
- computationally efficient
- conditional probabilities
- probabilistic inference
- bit rate
- reduction method
- probabilistic model
- linear computational complexity
- dependency graphs
- probabilistic classifiers
- universal relation
- inference in bayesian networks
- conditional probability distributions
- dependency structure
- temporal dependencies
- data dependencies
- probability distribution
- motion estimation
- structure learning
- storage requirements
- markov networks
- database
- low complexity
- naive bayes