Parameter Learning in Probabilistic Databases: A Least Squares Approach

author: Bernd Gutmann, Department of Computer Science, KU Leuven
author: Angelika Kimmig, Faculty of Applied Sciences, University of Freiburg
author: Luc De Raedt, Department of Computer Science, KU Leuven
author: Kristian Kersting, Fraunhofer IAIS
published: Oct. 10, 2008,   recorded: September 2008,   views: 3850


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


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 effectiveness of this least squares calibration of probabilistic databases.

See Also:

Download slides icon Download slides: ecmlpkdd08_gutmann_plip_01.pdf (2.2┬áMB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: