Towards Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm.

Marcel Gehrke Tanya Braun Ralf Möller

Published in: KI (2018)

Keyphrases

learning algorithm
junction tree
computational complexity
k means
np hard
dynamic programming
expectation maximization
bayesian networks
search space
probabilistic model
prior information
message passing
graphical models
matching algorithm
probabilistic inference