Preventing Groundings and Handling Evidence in the Lifted Junction Tree Algorithm.

Tanya Braun Ralf Möller

Published in: KI (2017)

Keyphrases

learning algorithm
junction tree
k means
dynamic programming
computational complexity
similarity measure
bayesian networks
optimal solution
search space
prior knowledge
np hard
message passing
worst case
graphical models
model selection
state variables