Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Inductive logic programming: issues, results and the challenge of learning language in logic
Artificial Intelligence - Special issue on applications of artificial intelligence
Inductive Logic Programming: Techniques and Applications
Inductive Logic Programming: Techniques and Applications
Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
A Framework for Defining Distances Between First-Order Logic Objects
ILP '98 Proceedings of the 8th International Workshop on Inductive Logic Programming
Kernels and Distances for Structured Data
Machine Learning
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
| Hi-index | 0.00 |
Distance-based methods have been a successful family of machine learning techniques since the inception of the discipline. Basically, the classification or clustering of a new individual is determined by the distance to one or more prototypes. From a comprehensibility point of view, this is not especially problematic in propositional learning where prototypes can be regarded as a good generalisation (pattern) of a group of elements. However, for scenarios with structured data, this is no longer the case. In recent work, we developed a framework to determine whether a pattern computed by a generalisation operator is consistent w.r.t. a distance. In this way, we can determine which patterns can provide a good representation of a group of individuals belonging to a metric space. In this work, we apply this framework to analyse and define minimal distance-based generalisation operators (mgoperators) for first-order data. We show that Plotkin's lggis a mgoperator for atoms under the distance introduced by J. Ramon, M. Bruynooghe and W. Van Laer. We also show that this is not the case for clauses with the distance introduced by J. Ramon and M. Bruynooghe. Consequently, we introduce a new mgoperator for clauses, which could be used as a base to adapt existing bottom-up methods in ILP.