Title: Learning directed probabilistic logical models: Ordering-search versus structure-search
Authors: Fierens, Daan ×
Ramon, Jan
Bruynooghe, Maurice
Blockeel, Hendrik #
Issue Date: 2007
Publisher: Springer
Host Document: Lecture Notes in Computer Science vol:4701 pages:567-574
Conference: European Conference on Machine Learning edition:18 location:Warsaw, Poland date:17-21 September 2007
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 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. We conclude that there is no signifcant difference between the two algorithms in terms of quality of the learnt models while ordering-search is signifcantly faster.
Description: Acceptance rate = 24%
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
07ECML_springer.pdf Published 282KbAdobe PDFView/Open


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

© Web of science