Successful application of Machine Learning to certain real-world situations sometimes requires to take into account relations among objects. Inductive Logic Programming, being based on First-Order Logic as a representation language, provides a suitable learning framework to be adopted in these cases. However, the intrinsic complexity of this framework, added to the complexity of the specific application context, often requires pure induction to be supported by various kinds of meta-information on the domain itself and/or on its representation in order to prune the search space of all possible definitions. Indeed, avoiding the exploration of paths that do not lead to any correct solution can greatly reduce computational times, and hence becomes a critical issue for the performance of the whole learning process. In the current practice, providing such information is often in charge of the human expert. It is also a difficult and error-prone activity, in which mistakes are highly probable because of a number of factors. This makes it desirable to develop procedures that can automatically generate such information starting from the same observations that are input to the learning process. This paper focuses on a specific kind of meta-information: the types used in the description language and their related domains. Indeed, many learning systems known in the literature are able to exploit (and sometimes require) such a kind of knowledge to improve their performance. An algorithm is proposed to automatically identify types from observations, and detailed examples of its behaviour are given. An evaluation of its performance in domains with different characteristics is reported, and its robustness with respect to incomplete observations is studied.

Automatic Induction of First-Order Logic Descriptors Type Domains from Observations

FERILLI, Stefano;ESPOSITO, Floriana;BASILE, TERESA MARIA;DI MAURO, NICOLA
2004-01-01

Abstract

Successful application of Machine Learning to certain real-world situations sometimes requires to take into account relations among objects. Inductive Logic Programming, being based on First-Order Logic as a representation language, provides a suitable learning framework to be adopted in these cases. However, the intrinsic complexity of this framework, added to the complexity of the specific application context, often requires pure induction to be supported by various kinds of meta-information on the domain itself and/or on its representation in order to prune the search space of all possible definitions. Indeed, avoiding the exploration of paths that do not lead to any correct solution can greatly reduce computational times, and hence becomes a critical issue for the performance of the whole learning process. In the current practice, providing such information is often in charge of the human expert. It is also a difficult and error-prone activity, in which mistakes are highly probable because of a number of factors. This makes it desirable to develop procedures that can automatically generate such information starting from the same observations that are input to the learning process. This paper focuses on a specific kind of meta-information: the types used in the description language and their related domains. Indeed, many learning systems known in the literature are able to exploit (and sometimes require) such a kind of knowledge to improve their performance. An algorithm is proposed to automatically identify types from observations, and detailed examples of its behaviour are given. An evaluation of its performance in domains with different characteristics is reported, and its robustness with respect to incomplete observations is studied.
2004
3-540-22941-8
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11586/112030
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 4
social impact