Kari Rantanen

2 accepted papers

2021

Maximal ancestral graph structure learning via exact search

Kari Rantanen, Antti Hyttinen, Matti Järvisalo

UAI 2021poster

Generalizing Bayesian networks, maximal ancestral graphs (MAGs) are a theoretically appealing model class for dealing with unobserved variables. Despite significant advances in developing practical exact algorithms for learning score-optimal Bayesian networks, practical exact algorithms for learning…

Cited by 11 Source ↗PDF ↗Scholar ↗

2017

Learning Chordal Markov Networks via Branch and Bound

Kari Rantanen, Antti Hyttinen, Matti Järvisalo

NeurIPS 2017poster

We present a new algorithmic approach for the task of finding a chordal Markov network structure that maximizes a given scoring function. The algorithm is based on branch and bound and integrates dynamic programming for both domain pruning and for obtaining strong bounds for search-space pruning. Em…

Cited by 10 Source ↗PDF ↗Scholar ↗