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

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

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferencia

1 Cita (Scopus)

Resumen

© 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.
Idioma originalInglés estadounidense
Título de la publicación alojadaClosed-form solutions in learning probabilistic logic programs by exact score maximization
Páginas119-133
Número de páginas15
ISBN (versión digital)9783319675817
DOI
EstadoPublicada - 1 ene 2017
Publicado de forma externa
EventoLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duración: 1 ene 2018 → …

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen10564 LNAI
ISSN (versión impresa)0302-9743

Conferencia

ConferenciaLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Período1/01/18 → …

Huella Profundice en los temas de investigación de 'Closed-form solutions in learning probabilistic logic programs by exact score maximization'. En conjunto forman una huella única.

  • Citar esto

    Otte Vieira de Faria, F. H., Cozman, F. G., & Mauá, D. D. (2017). Closed-form solutions in learning probabilistic logic programs by exact score maximization. En Closed-form solutions in learning probabilistic logic programs by exact score maximization (pp. 119-133). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10564 LNAI). https://doi.org/10.1007/978-3-319-67582-4_9