Login / Signup
Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm.
Marcel Gehrke
Tanya Braun
Ralf Möller
Published in:
Australasian Conference on Artificial Intelligence (2018)
Keyphrases
</>
dynamic programming
junction tree
computational complexity
worst case
k means
similarity measure
expectation maximization
message passing
learning algorithm
probabilistic inference
optimal solution
np hard
probabilistic model
neural network
graphical models
em algorithm
parameter estimation
matching algorithm