Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ILP
2007
Springer

favoriteEmaildiscussreport

206views Automated Reasoning» more ILP 2007»

Using Bayesian Networks to Direct Stochastic Search in Inductive Logic Programming

13 years 10 months ago

Using Bayesian Networks to Direct Stochastic Search in Inductive Logic Programming

Download ftp.cs.wisc.edu

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 modiﬁcations.

Louis Oliphant, Jude W. Shavlik

Real-time Traffic

Artificial Intelligence | Bayesian Network Model | Candidate Clauses | ILP 2007 | Large Datasets |

claim paper

Related Content

» Abductive Stochastic Logic Programs for Metabolic Network Inhibition Learning

» Learning an Approximation to Inductive Logic Programming Clause Evaluation

» Learning Optimal Dialogue Management Rules by Using Reinforcement Learning and Inductive L...

» Bayesian learning of Bayesian networks with informative priors

» Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops

» A Hybrid Approach to Discover Bayesian Networks From Databases Using Evolutionary Programm...

» Combining Bayesian Networks with HigherOrder Data Representations

» ObjectOriented Bayesian Networks

» Learning probabilistic logic models from probabilistic examples

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ILP
Authors	Louis Oliphant, Jude W. Shavlik

Comments (0)