论文信息 - Reduction of ILP Search Space with Bottom-Up Propositionalisation

Reduction of ILP Search Space with Bottom-Up Propositionalisation

This paper introduces a method for algorithmic reduction of the search space of an ILP task, omitting the need for explicit language bias. It relies on bottom-up propositionalisation of examples and background knowledge. A proof of concept has been developed for observational learning of stratified normal logic programs.

Alessandra Russo | Hadeel Al-Negheimish

[1] Artur S. d'Avila Garcez,et al. Fast relational learning using bottom clause propositionalization with artificial neural networks , 2013, Machine Learning.

[2] J. R. Quinlan. Learning Logical Definitions from Relations , 1990 .

[3] Thomas G. Dietterich. What is machine learning? , 2020, Archives of Disease in Childhood.

[4] Eric McCreath,et al. Extraction of Meta-Knowledge to Restrict the Hypothesis Space for ILP Systems , 1995 .

[5] Saso Dzeroski,et al. Learning Nonrecursive Definitions of Relations with LINUS , 1991, EWSL.

[6] Stephen Muggleton,et al. Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited , 2013, Machine Learning.

[7] Geoffrey E. Hinton,et al. Learning distributed representations of concepts. , 1989 .

[8] S. Džeroski,et al. Relational Data Mining , 2001, Springer Berlin Heidelberg.

[9] Ryszard S. Michalski,et al. Inductive inference of VL decision rules , 1977, SGAR.

[10] Luc De Raedt,et al. Logical and relational learning , 2008, Cognitive Technologies.