Title: Generalized ordering-search for learning directed probabilistic logical models
Authors: Ramon, Jan
Croonenborghs, Tom
Fierens, Daan
Blockeel, Hendrik
Bruynooghe, Maurice
Issue Date: 2007
Publisher: Springer
Host Document: Lecture Notes in Computer Science vol:4455 pages:40-42
Conference: Inductive Logic Programming edition:16 location:Santiago de Compostella, Spain date:24-27 August 2006
Abstract: Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although many authors provide high-level arguments to show that in principle models in their language can be learned from data, most of the proposed learning algorithms have not yet been studied in detail. We introduce an algorithm, generalized ordering-search, to learn both structure and conditional probability distributions (CPDs) of directed probabilistic logical models. The algorithm upgrades the ordering-search algorithm for Bayesian networks. We use relational probability trees as a representation for the CPDs. We present experiments on blocks world domains, a gene domain and the Cora dataset.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
Technologiecluster Computerwetenschappen
Computer Science Technology TC, Technology Campus Geel

Files in This Item:
File Status SizeFormat
ilp.pdf Published 34KbAdobe PDFView/Open


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

© Web of science