UNI-MB - logo
UMNIK - logo
 
(UM)
  • Refinement graphs for FOIL and LINUS
    Džeroski, Sašo ; Lavrač, Nada
    Learning can be viewed as heuristic search of the space of concept descriptions. A learning system can, therefore, be described in terms of the structure of its search space, its search heuristics ... and search strategy. It is possible to structure the search space by using refinement operators for generalizing or specializing concept descriptions. In this paper, the framework of refinement graphs is used to describe two inductive learning systems, FOIL and LINUS, which learn definitons of relations in the form of logic programs. We describe their search spaces by defining a refinement operator for each of the systems. This enables the comparison of FOIL and LINUS in terms of the expressiveness of their concept description languages, and the complexity of searching their refinement graphs. Their search heuristics and search strategies are described as well as the total search costs.
    Vir: Inductive logic programming (Str. 319-333)
    Vrsta gradiva - članek, sestavni del
    Leto - 1992
    Jezik - angleški
    COBISS.SI-ID - 2714646

Vnos na polico