Using Bayesian networks to direct stochastic search in inductive logic programming

Authors:
Louis Oliphant;Jude Shavlik
Affiliations:
Computer Sciences Department, University of Wisconsin-Madison;Computer Sciences Department, University of Wisconsin-Madison
Venue:
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Year:
2007

Citing 7
Cited 1

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Learning evaluation functions for global optimization and Boolean satisfiability

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The Cross Entropy Method: A Unified Approach To Combinatorial Optimization, Monte-carlo Simulation (Information Science and Statistics)

The Cross Entropy Method: A Unified Approach To Combinatorial Optimization, Monte-carlo Simulation (Information Science and Statistics)
Markov logic networks

Machine Learning
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves

Machine Learning
Representing sentence structure in hidden Markov models for information extraction

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Lattice-search runtime distributions may be heavy-tailed

ILP'02 Proceedings of the 12th international conference on Inductive logic programming

Learning theories using estimation distribution algorithms and (reduced) bottom clauses

ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Stochastically searching the space of candidate clauses is an appealing way to scale up ILP to large datasets. We address an approach that uses a Bayesian network model to adaptively guide search in this space. We examine guiding search towards areas that previously performed well and towards areas that ILP has not yet thoroughly explored. We show improvement in area under the curve for recall-precision curves using these modifications.