A theory of inductive learning is presented that characterizes it as a heuristic search through a space of symbolic descriptions, generated by an application of certain inference rules to the initial observational statements (the teacher-provided examples of some concepts, or facts about a class of objects or a phenomenon). The inference rules include generalization rules, which perform generaliz-ing transformations on descriptions, and conventional truth-preserving deductive rules (specialization and reformulation rules). The application of the inference rules to descriptions is constrained by problem background knowledge, and guided by criteria evaluating the 'quality' of generated inductive assertions. Based on this theory, a general methodology for learning structural descriptions from examples, called STAR, is described and illustrated by a problem from the area of conceptual data analysis.
CITATION STYLE
Michalski, R. S. (1983). A Theory and Methodology of Inductive Learning. In Machine Learning (pp. 83–134). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-12405-5_4
Mendeley helps you to discover research relevant for your work.