Abstract
This paper addresses the problem of using explanation-based generalizations of negative inputs in Mitchell's candidate elimination algorithm and in other more recent approaches to version spaces. It points out that a mere combination would produce a worse result than that obtainable without input preprocessing, whereas this problem was not perceived in previous work. Costs and benefits of the extra computation required to take advantage of prior EBL phase are analysed for a conjunctive concept languages defined on a tree-structured attribute-based instance space. Furthermore, this result seems to be independent of the particular inductive learning algorithm considered (i.e., version spaces), thus helping clarify one aspect of the ill-understood relation between analytical generalization and empirical generalization.
Chapter PDF
References
Carpineto, C. (1990). Combining EBL from success and EBL from failure with parameter version spaces. 9th European Conference on Artificial Intelligence. Stockholm.
Charniak, E., McDermott, D. (1986). Introduction to Artificial Intelligence. Addison-Wesley
Ellman, T. (1989). Explanation-Based Learning: A Survey of Programs and Perspectives. ACM Computing Surveys, 21(2), 163–221.
Hirsh, H. (1989). Combining Empirical and Analytical Learning with Version Spaces. 6th International Workshop on Machine Learning. Syracuse, New York.
Hirsh, H. (1990). Incremental Version-Space Merging 7th International Conference on Machine Learning. Austin, Texas.
Michalski, R.S. (1983). A theory and methodology of inductive learning. Artificial Intelligence, 20, 111–161
Minton, S., Carbonell, J. G. (1987). Strategies for Learning Search Control Rules:An Explanation-based Approach. 10th IJCAI, Milan, Italy.
Mitchell, T. M. (1978). Version Spaces: An Approach to Concept learning. PhDthesis, Stanford University.
Mitchell, T.M. (1982). Generalization as Search. Artificial Intelligence, 18, 203–226.
Mitchell, T.M., Utgoff, P. E., Banerji, R.B. (1982). Learning problem-solving heuristics by experimentation. In R.S. Michalski et al. (Eds), Machine Learning. Tioga Press, Palo Alto, California.
Utgoff, P.E. (1986). Shift of Bias for Inductive Concept Learning. In R.S. Michalski et al. (Eds), Machine Learning.Vol.II Morgan Kaufmann, Los Altos, California.
VanLehn, K. (1989). Efficient Specialization of Relational Concepts. Machine Learning 4 (1), 99–106.
Winston, P. H. (1975). Learning structural descriptions from examples. In P.H. Winston (Ed.), The psychology of computer vision. New York: McGraw-Hill.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carpineto, C. (1991). Analytical negative generalization and empirical negative generalization are not cumulative: A case study. In: Kodratoff, Y. (eds) Machine Learning — EWSL-91. EWSL 1991. Lecture Notes in Computer Science, vol 482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017005
Download citation
DOI: https://doi.org/10.1007/BFb0017005
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53816-5
Online ISBN: 978-3-540-46308-5
eBook Packages: Springer Book Archive