Inductive logic programming meets relational databases: Efficient learning of markov logic networks

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Statistical Relational Learning (SRL) approaches have been developed to learn in presence of noisy relational data by combining probability theory with first order logic. While powerful, most learning approaches for these models do not scale well to large datasets. While advances have been made on using relational databases with SRL models [14], they have not been extended to handle the complex model learning (structure learning task). We present a scalable structure learning approach that combines the benefits of relational databases with search strategies that employ rich inductive bias from Inductive Logic Programming. We empirically show the benefits of our approach on boosted structure learning for Markov Logic Networks.

Cite

CITATION STYLE

APA

Malec, M., Khot, T., Nagy, J., Blask, E., & Natarajan, S. (2017). Inductive logic programming meets relational databases: Efficient learning of markov logic networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10326 LNAI, pp. 14–26). Springer Verlag. https://doi.org/10.1007/978-3-319-63342-8_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free