Abstract
In the traditional learning framework, hypothesis that are not equivalent with respect to the standard subsomption relation can be equivalent from the learning's point of view. We define in this paper a new subsumption relation, called empirical subsumption, that allows to take into account this fact. This new subsomption relation is then used to define a particular kind of search space reduction that do not reduce the class of learnable concepts. Then, we show that theses theoretical results can be applied when the knowledge representation formalism is the conceptual graph formalism.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Brezellec, P., Soldano, H.: ELENA: a bottom-up learning method. Tenth International Conference on Machine Learning. Amherst (Massachusetts, USA). Morgan Kaufmann. (1993) 9–16.
Champesme, M.: Apprentissage par detection de similarites utilisant le formalisme des graphes conceptuels. Phd Thesis, Paris XIII (1993).
Champesme, M.: Operateurs de raffinements ideaux pour les graphes conceptuels. Prepublication LIPN (1994).
Chein, M., Mugnier, Marie-Laure: Conceptual Graphs: fundamental notions. Revue d'Intelligence Artificielle, 6 (1992) 365–406.
Van der Laag, P.R.J., Nienhuys-Cheng, Shan-Hwei: Subsumption and refinement in model inference. ECML-93, European Conference on Machine Learning. Vienna, Austria. Springer-Verlag.(1993) 95–114.
Van der Laag, P.R.J., Nienhuys-Cheng, Shan-Hwei: Existence and Nonexistence of Complete Refinement Operators. ECML-94, European Conference on Machine Learning. Springer Verlag. (1994) 307–322.
Van der Laag, P.R.J., Nienhuys-Cheng, Shan-Hwei: A note on ideal refinement operators in inductive logic programming. ILP-94, Fourth International Workshop on Inductive Logic Programming. GMD. Bad Honnef/Bonn, Germany. (1994) 247–260.
Levinson, R.A.: APS: An architecture for experience-based knowledge acquisition. Workshop on Computational Architectures for Supporting Machine Learning and Knowledge Acquisition at Machine Learning Conference. Aberdeen (Scotland). Morgan Kaufmann. (1992).
Liquiere, M.: Apprentissage a partir d'objets structures: Conception et realisation. These de 3eme cycle, Montpellier. (1990).
Mineau G.W.: Acquisition d'objets structures destines a la classification symbolique. Premieres Journees Francophones d'Apprentissage et d'explicitation des Connaissances. Dourdan (France). (1992) 131–145.
Muggleton, S., Feng, C.: Efficient Induction of Logic Programs. In Muggleton S. (Eds.), Inductive Logic Programming. Academic Press. (1992) 281–298.
Plotkin, G.D.: A further note on inductive generalisation. Machine Intelligence, 6 (1971) 101–124.
Quinlan, J. R.: Learning logical definitions from relations. Machine Learning, 5, (1990) 239–266.
Shapiro, E. Y.: Algorithmic program debugging. MIT Press. (1983).
Sowa, J.F.: Conceptual Structures, information processing in mind and machine. Addison Wesley. (1984).
Winston, P.H.: Learning structural descriptions from examples. In P.H. Winston (Eds.), The psychology of computer vision. McGraw Hill. (1975).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Champesme, M. (1995). Using empirical subsumption to reduce the search space in learning. In: Ellis, G., Levinson, R., Rich, W., Sowa, J.F. (eds) Conceptual Structures: Applications, Implementation and Theory. ICCS 1995. Lecture Notes in Computer Science, vol 954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60161-9_38
Download citation
DOI: https://doi.org/10.1007/3-540-60161-9_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60161-6
Online ISBN: 978-3-540-49539-0
eBook Packages: Springer Book Archive