Please use this identifier to cite or link to this item:
Author(s): Nuno Fonseca
Ricardo Rocha
Rui Camacho
Fernado Silva
Title: Efficient data structures for inductive logic programming
Issue Date: 2003
Abstract: This work aims at improving the scalability of memory usagein Inductive Logic Programming systems. In this context, we propose twoecient data structures: the Trie, used to represent lists and clauses;and the RL-Tree, a novel data structure used to represent the clausescoverage. We evaluate their performance in the April system using wellknown datasets. Initial results show a substantial reduction in memoryusage without incurring extra execution time overheads. Our proposal isapplicable in any ILP system.
Subject: Engenharia de computadores, Engenharia electrotécnica, electrónica e informática
Source: 13th International Conference on Inductive Logic Programming (ILP 2003)
Document Type: Artigo em Livro de Atas de Conferência Internacional
Rights: openAccess
Appears in Collections:FEUP - Artigo em Livro de Atas de Conferência Internacional

Files in This Item:
File Description SizeFormat 
64140.pdfEfficient Data Structures for Inductive Logic Programming122.24 kBAdobe PDFThumbnail

This item is licensed under a Creative Commons License Creative Commons