In this paper, we present a generative algorithm to learn Markov Logic Network (MLN) structures automatically, directly from a training dataset. The algorithm follows a bottom-up approach by first heuristically transforming the training dataset into boolean tables, then creating candidate clauses using these boolean tables and finally choosing the best clauses to build the MLN. Comparisons to the state-of-the-art structure learning algorithms for MLNs in two 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).
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com