ILP - Just trie it

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2008

Autores

Rui Camacho (Autor) FEUP; Nuno A. Fonseca (Autor) Outra; Ricardo Rocha (Autor) FCUP; Vítor Santos Costa (Autor) FCUP

Ata de Conferência Internacional

Título: INDUCTIVE LOGIC PROGRAMMING

Páginas: 78-87

Joint Conference of the 17th International Conference on Inductive Logic Programming/24th International Conference on Machine Learning

Corvallis, OR, JUN 19-21, 2007

Indexação

ISI Web of Knowledge - 0 Citações

Scopus - 3 Citações

INSPEC

Classificação Científica

FOS: Ciências exactas e naturais > Ciências da computação e da informação

Outras Informações

ID Authenticus: P-004-3J8

DOI: 10.1007/978-3-540-78469-2_11

Abstract (EN): Despite the considerable success of Inductive Logic Programming (ILP), deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques have been proposed to address the efficiency issue. Such proposals include query transformations, query packs, lazy evaluation and parallel execution of ILP systems, to mention just a few. We propose a novel technique that avoids the procedure of deducing each example to evaluate each constructed clause. The technique takes advantage of the two stage procedure of Mode Directed Inverse Entailment (MDIE) systems. In the first stage of a MDIE system, where the bottom clause is constructed, we store not only the bottom clause but also valuable additional information. The information stored is sufficient to evaluate the clauses constructed in the second stage without the need for a theorem prover. We used a data structure called Trie to efficiently store all bottom clauses produced using all examples (positive and negative) as seeds. The technique was implemented and evaluated using two well known data sets from the ILP literature. The results are promising both in terms of execution time and accuracy.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 10