Closed-form solutions in learning probabilistic logic programs by exact score maximization

Francisco Henrique Otte Vieira de Faria, Fabio Gagliardi Cozman, Denis Deratani Mauá

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

© Springer International Publishing AG 2017. We present an algorithm that learns acyclic propositional probabilistic logic programs from complete data, by adapting techniques from Bayesian network learning. Specifically, we focus on score-based learning and on exact maximum likelihood computations. Our main contribution is to show that by restricting any rule body to contain at most two literals, most needed optimization steps can be solved exactly. We describe experiments indicating that our techniques do produce accurate models from data with reduced numbers of parameters.
Original languageAmerican English
Title of host publicationClosed-form solutions in learning probabilistic logic programs by exact score maximization
Pages119-133
Number of pages15
ISBN (Electronic)9783319675817
DOIs
StatePublished - 1 Jan 2017
Externally publishedYes
EventLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duration: 1 Jan 2018 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10564 LNAI
ISSN (Print)0302-9743

Conference

ConferenceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Period1/01/18 → …

Fingerprint

Dive into the research topics of 'Closed-form solutions in learning probabilistic logic programs by exact score maximization'. Together they form a unique fingerprint.

Cite this