Compact Representation of Knowledge Bases in Inductive Logic Programming

Issue Title: Inductive Logic Programming (ILP) In many applications of Inductive Logic Programming (ILP), learning occurs from a knowledge base that contains a large number of examples. Storing such a knowledge base may consume a lot of memory. Often, there is a substantial overlap of information be...

Full description

Saved in:
Bibliographic Details
Published in:Machine learning Vol. 57; no. 3; pp. 305 - 333
Main Authors: Struyf, Jan, Ramon, Jan, Bruynooghe, Maurice, Verbaeten, Sofie, Blockeel, Hendrik
Format: Journal Article
Language:English
Published: Dordrecht Springer Nature B.V 01.12.2004
Subjects:
Logic programming
Studies
ISSN:0885-6125, 1573-0565
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Issue Title: Inductive Logic Programming (ILP) In many applications of Inductive Logic Programming (ILP), learning occurs from a knowledge base that contains a large number of examples. Storing such a knowledge base may consume a lot of memory. Often, there is a substantial overlap of information between different examples. To reduce memory consumption, we propose a method to represent a knowledge base more compactly. We achieve this by introducing a meta-theory able to build new theories out of other (smaller) theories. In this way, the information associated with an example can be built from the information associated with one or more other examples and redundant storage of shared information is avoided. We also discuss algorithms to construct the information associated with example theories and report on a number of experiments evaluating our method in different problem domains.[PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0885-6125
1573-0565
DOI:10.1023/B:MACH.0000039780.84966.04