Learning directed probabilistic logical models: ordering-search versus structure-search

Authors:
Daan Fierens;Jan Ramon;Maurice Bruynooghe;Hendrik Blockeel
Affiliations:
Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium 3001;Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium 3001;Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium 3001;Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium 3001
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2008

Citing 14
Cited 3

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
A Bayesian Method for the Induction of Probabilistic Networks from Data

Machine Learning
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

Machine Learning
Learning to extract symbolic knowledge from the World Wide Web

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Learning Bayesian networks with local structure

Learning in graphical models
Learning Probabilistic Relational Models

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Learning equivalence classes of bayesian-network structures

The Journal of Machine Learning Research
Markov logic networks

Machine Learning
First order random forests: Learning relational classifiers with complex aggregates

Machine Learning
Parameter learning for relational Bayesian networks

Proceedings of the 24th international conference on Machine learning
Generalized ordering-search for learning directed probabilistic logical models

Machine Learning
Mapping and revising Markov logic networks for transfer learning

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Context-specific independence in Bayesian networks

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Logical bayesian networks and their relation to other probabilistic logical models

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

Context-Specific Independence in Directed Relational Probabilistic Models and its Influence on the Efficiency of Gibbs Sampling

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
On the relationship between logical Bayesian networks and probabilistic logic programming based on the distribution semantics

ILP'09 Proceedings of the 19th international conference on Inductive logic programming
On the combination of logical and probabilistic models for information analysis

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm initially proposed for Bayesian networks. In this paper we show how to upgrade another algorithm for learning Bayesian networks, namely ordering-search. For Bayesian networks, ordering-search was found to work better than structure-search. It is non-obvious that these results carry over to the relational case, however, since there ordering-search needs to be implemented quite differently. Hence, we perform an experimental comparison of these upgraded algorithms on four relational domains. We conclude that also in the relational case ordering-search is competitive with structure-search in terms of quality of the learned models, while ordering-search is significantly faster.