Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Experimental evaluation of a caching technique for ILP
Publication

Publications

Experimental evaluation of a caching technique for ILP

Title
Experimental evaluation of a caching technique for ILP
Type
Article in International Scientific Journal
Year
2003
Authors
Nuno Fonseca
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Vitor Santos Costa
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Rui Camacho
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Scientific classification
FOS: Natural sciences > Computer and information sciences
Other information
Authenticus ID: P-000-KGS
Abstract (EN): Inductive Logic Programming (ILP) is a Machine Learning technique that has been quite successful in knowledge discovery for relational domains. ILP systems implemented in Prolog challenge the limits of Prolog systems due to heavy usage of resources such as database accesses and memory usage, and to very long execution times. The major reason to implement ILP systems in Prolog is that the inference mechanism implemented by the Prolog engine is fundamental to most ILP learning algorithms. ILP systems can therefore benefit from the extensive performance improvement work that has taken place for Prolog. On the other hand, ILP is a non-classical Prolog application because it uses large sets of ground facts and requires storing a large search tree. One major criticism of ILP systems is that they often have long running times. A technique that tries to tackle this problem is coverage caching [?]. Coverage caching stores previous results in order to avoid recomputation. Naturally, this technique uses the Prolog internal database to store results. The question is: does coverage caching successfully reduce the ILP systems running time? To obtain an answer to this question we evaluated the impact of the coverage caching technique using the April [?] ILP system with the YAP Prolog system. To understand the results obtained we profiled Aprils execution and present initial results. The contribution of this paper is twofold: to an ILP researcher it provides an evaluation of the coverage caching technique implemented in Prolog using well known datasets; to a Prolog implementation researcher it shows the need of efficient internal database indexing mechanisms.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 5
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

On avoiding redundancy in inductive logic programming (2004)
Article in International Scientific Journal
Nuno Fonseca; Vitor S. Costa; Fernando Silva; Rui Camacho
Improving the efficiency of inductive logic programming systems (2009)
Article in International Scientific Journal
Nuno A. Fonseca; Vítor Santos Costa; Ricardo Rocha; Rui Camacho; Fernando Silva
A pipelined data-parallel algorithm for ILP (2006)
Article in International Conference Proceedings Book
Nuno A. Fonseca; Fernando Silva; Vitor Santos Costa; Rui Camacho
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-20 at 01:24:40 | Privacy Policy | Personal Data Protection Policy | Whistleblowing