作者: Daan Fierens , Jan Ramon , Maurice Bruynooghe , Hendrik Blockeel
DOI: 10.1007/S10472-009-9134-9
关键词:
摘要: We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm initially proposed for Bayesian networks. In this paper we show upgrade another learning networks, namely ordering-search. For ordering-search was found work better than structure-search. It is non-obvious that these results carry over case, however, since there needs be implemented quite differently. Hence, perform an experimental comparison of upgraded algorithms on four domains. conclude also in case competitive with terms quality learned models, while significantly faster.