ProbLog and its Application to Link Mining in Biological Networks

author: Luc De Raedt, Department of Computer Science, KU Leuven
published: Aug. 27, 2007,   recorded: August 2007,   views: 5116
Categories

Slides

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.
  Delicious Bibliography

Description

ProbLog is a recently introduced probabilistic extension of Prolog [De Raedt, Kimmig, Toivonen, IJCAI 07]. 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. It has been applied to link mining and discovery in a large biological network. In the talk, I will also discuss various learning settings for ProbLog and link mining, in particular, I shall present techniques for probabilistic local pattern mining, probabilistic explanation based learning [Kimmig, De Raedt, Toivonen, ECML 07] and theory compression from examples [De Raedt et al, ILP 96]. This is joint work with Angelika Kimmig, Hannu Toivonen, Kate Revoredo and Kristian Kersting.

See Also:

Download slides icon Download slides: mlg07_de_raedt_luc.pdf (3.8┬á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: