Learning directed probabilistic logical models from relational data

Authors:
Daan Fierens
Affiliations:
Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, 3001 Heverlee, Belgium. E-mail: daan.fierens@cs.kuleuven.be
Venue:
AI Communications
Year:
2008

Citing 7
Cited 0

Learning Bayesian networks with local structure

Learning in graphical models
Probabilistic logic learning

ACM SIGKDD Explorations Newsletter
Learning Bayesian Networks

Learning Bayesian Networks
Logical and Relational Learning: From ILP to MRDM (Cognitive Technologies)

Logical and Relational Learning: From ILP to MRDM (Cognitive Technologies)
Generalized ordering-search for learning directed probabilistic logical models

Machine Learning
A comparison of approaches for learning probability trees

ECML'05 Proceedings of the 16th European conference on Machine Learning
Logical bayesian networks and their relation to other probabilistic logical models

ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data that has a complex relational structure and in which observations are noisy or partially missing poses several challenges to traditional machine learning algorithms. One solution to this problem is the use of so-called probabilistic logical models (models that combine elements of first-order logic with probabilities) and corresponding learning algorithms. In this thesis we focus on directed probabilistic logical models. We show how to represent such models and develop several algorithms to learn such models from data.