Polynomial-time derivation of optimal k-tree topology from Markov networks.
Fereshteh R. DastjerdiLiming CaiPublished in: CoRR (2024)
Keyphrases
- markov networks
- graphical models
- bayesian networks
- special case
- maximum margin
- belief propagation
- maximum likelihood
- markov logic networks
- first order logic
- probabilistic model
- dynamic programming
- optimal solution
- markov random field
- computational complexity
- conditional random fields
- bayesian inference
- hidden variables
- probabilistic graphical models
- expert systems
- posterior probability
- inductive logic programming
- decision trees
- knowledge base
- machine learning