A Polynomial-Time Algorithm for Deciding Equivalence of Directed Cyclic Graphical Models.
Thomas RichardsonPublished in: UAI (1996)
Keyphrases
- graphical models
- probabilistic model
- computational complexity
- worst case
- learning algorithm
- optimal solution
- graph structure
- belief propagation
- bayesian networks
- search space
- dynamic programming
- factor graphs
- loopy belief propagation
- interactive dynamic influence diagrams
- gaussian graphical models
- directed acyclic
- belief networks
- closed form
- conditional random fields
- random variables
- energy function
- np hard
- k means