A sufficiently fast algorithm for finding close to optimal junction trees.

Ann Becker Dan Geiger

Published in: UAI (1996)

Keyphrases

dynamic programming
optimal solution
worst case
objective function
junction tree
learning algorithm
closed form
expectation maximization
computational complexity
np hard
k means
probabilistic model
search space
graphical models
lower bound
matching algorithm
belief state
reinforcement learning