Title: Estimating the parameters of probabilistic databases from probabilistically weighted queries and proofs [extended abstract]
Authors: Gutmann, Bernd
Kimmig, Angelika
Kersting, Kristian
De Raedt, Luc #
Issue Date: Sep-2008
Host Document: Inductive Logic Programming, Late Breaking Papers pages:38-43
Conference: Inductive Logic Programming 2008 (ILP 2008) edition:18 location:Prague, Czech Republik date:10-12 September 2008
Abstract: We introduce the problem of learning the parameters of the
probabilistic database ProbLog. Given the observed success probabilities of a set of queries, we compute the probabilities attached to facts that have a low approximation error on the training examples as well as on unseen examples. Assuming Gaussian error terms on the observed success probabilities, this naturally leads to a least squares optimization problem. Our approach, called LeProbLog, is able to learn both from queries and from proofs and even from both simultaneously. This makes it flexible and allows faster training in domains where the proofs are available. Experiments on real world data show the usefulness and efectiveness of this least squares calibration of probabilistic databases.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
# (joint) last author

Files in This Item:
File Description Status SizeFormat
ilp2008.pdfMain Article Published 169KbAdobe PDFView/Open
ILP2008_Poster_A4.pdfPoster Published 579KbAdobe PDFView/Open


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