ECML PKDD 2008
Paper abstractParameter Learning in Probabilistic Databases: A Least Squares ApproachBernd Gutmann - Katholieke Universiteit Leuven, BelgiumAngelika Kimmig - Katholieke Universiteit Leuven, Belgium Kristian Kersting - Fraunhofer IAIS, Germany Luc De Raedt - Katholieke Universiteit Leuven, Belgium Session: Multi Relational Springer Link: http://dx.doi.org/10.1007/978-3-540-87479-9_49 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. |