Minimal Distance-Based Generalisation Operators for First-Order Objects
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 (mg operators) for first-order data. We show that Plotkin’s lgg is a mg operator 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 mg operator for clauses, which could be used as a base to adapt existing bottom-up methods in ILP.
KeywordsCost Function Logic Programming Nerve Function Function Symbol Generalisation Operator
Unable to display preview. Download preview PDF.
- 1.Estruch, V.: A distance-based generalisation framework for model-based learning from structured data. PhD thesis, Technical University of Valencia (2007), http://www.dsic.upv.es/~flip/#Papers
- 2.Estruch, V., Ferri, C., Hernández-Orallo, J., Ramírez-Quintana, M.J.: Distance-based generalisation. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol. 3625, pp. 87–102. Springer, Heidelberg (2005)Google Scholar
- 3.Estruch, V., Ferri, C., Hernández-Orallo, J., Ramírez-Quintana, M.J.: Distance-based generalisation for graphs. In: Proc. of the WS of Mining and Learning with Graphs, MLG06 (2006)Google Scholar
- 6.Lloyd, J.W.: Foundations of logic programming (2nd extended edn.). Springer, New York (1987)Google Scholar
- 9.Nienhuys-Cheng, S-H.: Distance between Herbrand interpretations: A measure for approximations to a target concept. In: Džeroski, S., Lavrač, N. (eds.) Inductive Logic Programming. LNCS, vol. 1297, pp. 213–226. Springer, Heidelberg (1997)Google Scholar
- 10.Nienhuys-Cheng, S-H., de Wolf, R.: Foundations of Inductive Logic Programming. In: Džeroski, S., Lavrač, N. (eds.) Inductive Logic Programming. LNCS, vol. 1297, Springer, Heidelberg (1997)Google Scholar
- 13.Ramon, J., Bruynooghe, M., Van Laer, W.: Distance measures between atoms. In: CompulogNet Area Meeting on Computational Logic and Machine Learning, pp. 35–41. University of Manchester, UK (1998)Google Scholar