Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/74162| 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 usage in Inductive Logic Programming systems. In this context, we propose two ecient data structures: the Trie, used to represent lists and clauses; and the RL-Tree, a novel data structure used to represent the clauses coverage. We evaluate their performance in the April system using well known datasets. Initial results show a substantial reduction in memory usage without incurring extra execution time overheads. Our proposal is applicable in any ILP system. |
| Subject: | Engenharia de computadores, Engenharia electrotécnica, electrónica e informática Computer engineering, Electrical engineering, Electronic engineering, Information engineering |
| Scientific areas: | Ciências da engenharia e tecnologias::Engenharia electrotécnica, electrónica e informática Engineering and technology::Electrical engineering, Electronic engineering, Information engineering |
| DOI: | 10.1007/978-3-540-39917-9_10 |
| URI: | https://hdl.handle.net/10216/74162 |
| Source: | 13th International Conference on Inductive Logic Programming (ILP 2003) |
| Document Type: | Artigo em Livro de Atas de Conferência Internacional |
| Rights: | openAccess |
| License: | https://creativecommons.org/licenses/by-nc/4.0/ |
| Appears in Collections: | FEUP - Artigo em Livro de Atas de Conferência Internacional |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 64140.pdf | Efficient Data Structures for Inductive Logic Programming | 122.24 kB | Adobe PDF |  View/Open |
This item is licensed under a Creative Commons License
