A Polynomial-Time Algorithm for Deciding Markov Equivalence of Directed Cyclic Graphical Models
Thomas S. RichardsonPublished in: CoRR (2013)
Keyphrases
- graphical models
- probabilistic model
- computational complexity
- graph structure
- belief propagation
- worst case
- factor graphs
- np hard
- loopy belief propagation
- gaussian graphical models
- dynamic programming
- belief networks
- search space
- optimal solution
- directed acyclic
- learning algorithm
- parameter estimation
- hidden markov models
- approximation algorithms
- probabilistic inference
- conditional independence
- exact inference
- relational databases
- map inference