Abstract
In this paper, we introduce a formal framework for investigating the relationship of inductive inference and the task of classification. We give the first results on the relationship between functions that can be identified in the limit and functions that can be acquired from unclassified objects only. Moreover, we present results on the complexity of classification functions and the preconditions necessary in order to allow the computation of such functions.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Freivalds, J. Barzdin, and K. Podnieks. Inductive inference of recursive functuions: complexity bounds. In Lecture Notes in Computer Science, volume 502, pages 111–151. Springer-Verlag, 1991.
A. G. Hoffmann. Connectionist functionality and the emergent network behavior. Neurocomputing — An International Journal, 2(2):161–172, 1991.
T. Kohonen. Self-Organization and Associative Memory. Springer-Verlag, Heidelberg, West-Germany, 1984.
A. N. Kolmogorov. Three approaches to the quantitative definition of information. International Journal for Computer Mathematics, 2:157–168, 1968. (originally published in Russian: Problemi peredachi informacii, vol. 1, No. 1, 1965, p. 3–11.).
L. Valiant. A theory of the learnable. Communications of the ACM, 27:1134–1142, 1984.
C. von der Malsburg. Network self-organization. In S. F. Zornetzer, J. L. Davis, and C. Lau, editors, An Introduction to Neural and Electronic Networks, pages 421–432. Academic Press, New York, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freivalds, R., Hoffmann, A.G. (1992). An inductive inference approach to classification. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1992. Lecture Notes in Computer Science, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56004-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-56004-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56004-3
Online ISBN: 978-3-540-47339-8
eBook Packages: Springer Book Archive