Title: Learning directed probabilistic logical models: Ordering-search versus structure-search
Authors: Fierens, Daan ×
Ramon, Jan
Bruynooghe, Maurice
Blockeel, Hendrik #
Issue Date: Nov-2008
Publisher: J.C. Baltzer
Series Title: Annals of Mathematics and Artificial Intelligence vol:54 issue:1-3 pages:99-133
Abstract: 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 how to upgrade another algorithm for learning Bayesian networks, namely ordering-search. For Bayesian networks, ordering-search was found to work better than structure-search. It is non-obvious that these results carry over to the relational case, however, since there ordering-search needs to be implemented quite differently. Hence, we perform an experimental comparison of these upgraded algorithms on four relational domains. We conclude that also in the relational case ordering-search is competitive with structure-search in terms of quality of the learned models, while ordering-search is significantly faster.
ISSN: 1012-2443
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
amai_fierens.pdfMain article Published 231KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science