Heuristic Method for Discriminative Structure Learning of Markov Logic Networks

Abstract

In this paper, we present a heuristic-based algorithm to learn discriminative MLN structures automatically, directly from a training dataset. The algorithm heuristically transforms the relational dataset into boolean tables from which it builds candidate clauses for learning the final MLN. Comparisons to the state-of-the-art structure learning algorithms for MLNs in the three real-world domains show that the proposed algorithm outperforms them in terms of the conditional log likelihood (CLL), and the area under the precision-recall curve (AUC).