Discovering a junction tree behind a Markov network by a greedy algorithm
Tamás SzántaiEdith KovácsPublished in: CoRR (2011)
Keyphrases
- greedy algorithm
- markov networks
- junction tree
- bayesian networks
- belief propagation
- probabilistic graphical models
- graphical models
- message passing
- probabilistic inference
- maximum margin
- dynamic programming
- exact inference
- maximum likelihood
- posterior probability
- probabilistic model
- conditional probabilities
- stereo matching
- belief networks
- hidden variables
- markov random field
- structure learning
- worst case
- conditional random fields
- structured prediction
- approximate inference
- influence diagrams
- graph cuts
- bayesian inference
- conditional independence
- objective function
- random variables
- first order logic
- probability distribution
- incomplete data
- energy function
- pairwise
- document classification