CW 490

Daan Fierens, Jan Ramon, Maurice Bruynooghe and Hendrik Blockeel
Learning directed probabilistic logical models: ordering-search versus structure-search

Abstract

There is an increasing interest in upgrading Bayesian networks to the relational case, resulting in so-called directed probabilistic logical models. In this paper we discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has already been tackled before by upgrading the structure-search algorithm for learning Bayesian networks. In this paper we propose to upgrade another algorithm, namely ordering-search, since for Bayesian networks this was found to work better than structure-search. We experimentally compare the two upgraded algorithms on two relational domains.

report.pdf (248K) / mailto: D. Fierens