L. Oliphant & J. Shavlik (2007).
Using Bayesian Networks to Direct Stochastic Search in Inductive Logic Programming. Proceedings of the Seventeenth Conference on Inductive Logic Programming, Corvallis, Oregon.
Poster (PS). Slides (PPT).
This publication is available in PDF.
The poster version of this publication is available in postscript.
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.
Computer Sciences Department
College of Letters and Science
University of Wisconsin - Madison
INFORMATION ~ PEOPLE ~ GRADS ~ UNDERGRADS ~ RESEARCH ~ RESOURCES
5355a Computer Sciences and Statistics ~ 1210 West Dayton Street, Madison, WI 53706
firstname.lastname@example.org ~ voice: 608-262-1204 ~ fax: 608-262-9777