Login / Signup
Empirical hardness of finding optimal Bayesian network structures: algorithm selection and runtime prediction.
Brandon M. Malone
Kustaa Kangas
Matti Järvisalo
Mikko Koivisto
Petri Myllymäki
Published in:
Mach. Learn. (2018)
Keyphrases
</>
finding optimal
np hard
computational complexity
objective function
monte carlo
learning algorithm
search space
k means
worst case
optimal or near optimal
bayesian networks
optimal solution
lower bound
dynamic programming
upper bound