Abstract
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.
This work has been partially supported by the EU (FEDER) and the Spanish MEC under grant TIN 2004-7943-C04-02, ICT for EU-India Cross-Cultural Dissemination Project under grant ALA/95/23/2003/077-054, Generalitat Valenciana under grant GV06/301 and UPV under grant TAMAT.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
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)
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)
Gaertner, T., Lloyd, J.W., Flach, P.A.: Kernels and distances for structured data. Machine Learning 57(3), 205–232 (2004)
Lavrac, N., Dzeroski, S.: Inductive Logic Programming: Techniques and Applications. Ellis Horwood, New York (1994)
Lloyd, J.W.: Foundations of logic programming (2nd extended edn.). Springer, New York (1987)
Muggleton, S.: Inductive Logic Programming. New Generation Computing 8(4), 295–318 (1991)
Muggleton, S.H.: Inductive logic programming: Issues, results, and the challenge of learning language in logic. Artificial Intelligence 114(1–2), 283–296 (1999)
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)
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)
Plotkin, G.: A note on inductive generalization. Machine Intelligence 5, 153–163 (1970)
Ramon, J., Bruynooghe, M.: A framework for defining distances between first-order logic objects. In: Page, D.L. (ed.) Inductive Logic Programming. LNCS, vol. 1446, pp. 271–280. Springer, Heidelberg (1998)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Estruch, V., Ferri, C., Hernández-Orallo, J., Ramírez-Quintana, M.J. (2007). Minimal Distance-Based Generalisation Operators for First-Order Objects. In: Muggleton, S., Otero, R., Tamaddoni-Nezhad, A. (eds) Inductive Logic Programming. ILP 2006. Lecture Notes in Computer Science(), vol 4455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73847-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-73847-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73846-6
Online ISBN: 978-3-540-73847-3
eBook Packages: Computer ScienceComputer Science (R0)