T. Khot, S. Natarajan, K. Kersting & J. Shavlik (2011).
Learning Markov Logic Networks via Functional Gradient Boosting. Proceedings of the IEEE International Conference on Data Mining (ICDM).
Slides (PPTX).

This publication is available in PDF.

The slides for this publication are available in Microsoft PowerPoint.

Abstract:

Recent years have seen a surge of interest in Statistical Relational Learning (SRL) models that combine logic with probabilities. One prominent example is Markov Logic Networks (MLNs). While MLNs are indeed highly expressive, this expressiveness comes at a cost. Learning MLNs is a hard problem and therefore has attracted much interest in the SRL community. Current methods for learning MLNs follow a twostep approach: first, perform a search through the space of possible clauses and then learn appropriate weights for these clauses. We propose to take a different approach, namely to learn both the weights and the structure of the MLN simultaneously. Our approach is based on functional gradient boosting where the problem of learning MLNs is turned into a series of relational functional approximation problems. We use two kinds of representations for the gradients: clausebased and tree-based. Our experimental evaluation on several benchmark data sets demonstrates that our new approach can learn MLNs as good or better than those found with state-ofthe- art methods, but often in a fraction of the time.

Return to the publications of the Univ. of Wisconsin Machine Learning Research Group.