Abstract (EN):
This work aims at improving the scalability of memory usage in Inductive Logic Programming systems. In this context, we propose two efficient 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.
Language:
English
Type (Professor's evaluation):
Scientific
Contact:
nf@ncc.up.pt; ricroc@ncc.up.pt; rcamacho@fe.up.pt; ricroc@ncc.up.pt
No. of pages:
16