By Topic

Knowledge acquisition from structured data: using determinate literals to assist search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Quinlan, J.R. ; Basser Dept. of Comput. Sci., Sydney Univ., NSW, Australia

A description is given of the FOIL (First-Order Inductive Learner) system, which exploits information from large numbers of examples to guide the search for a program. FOIL develops first-order rules from structured data described by a collection of relations. The guidance it provides turns out to be so effective that greedy search is usually adequate. Algorithms using greedy search, however, tend to suffer from a horizon effect: an action that might be desirable or even essential from a global perspective can appear relatively unpromising at a local level and so may be passed over. Rather than restricting the search space, and thus the class of learnable programs, FOIL exploits determinism to overcome some of the horizon effect of greedy search. The effect on learning time is usually negligible.<>

Published in:

IEEE Expert  (Volume:6 ,  Issue: 6 )