Title: Compressing probabilistic Prolog programs
Authors: De Raedt, Luc
Kersting, Kristian
Kimmig, Angelika ×
Revoredo, Kate
Toivonen, Hannu #
Issue Date: Mar-2008
Publisher: Kluwer Academic Publishers
Series Title: Machine learning vol:70 issue:2-3 pages:151-168
Abstract: ProbLog is a recently introduced probabilistic extension of Prolog [De Raedt et al. IJCAI 2007]. A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belongs to a randomly sampled program, and these probabilities are mutually independent. The semantics of ProbLog is then defined by the success probability of a query in a randomly sampled program.

This paper introduces the theory compression task for ProbLog, which consists of selecting that subset of clauses of a given ProbLog program that maximizes the likelihood w.r.t. a set of positive and negative examples. Experiments in the context of discovering links in real biological networks demonstrate the practical applicability of the approach.
ISSN: 0885-6125
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
tc_mlj07_authors.pdfMain article Published 296KbAdobe PDFView/Open


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

© Web of science