Results 1 -
4 of
4
Induction of Decision Trees
- Mach. Learn
, 1986
"... systems Abstract. The technology for building knowledge-based systems by inductive inference from examples has been demonstrated successfully in several practical applications. This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describ ..."
Abstract
-
Cited by 2888 (3 self)
- Add to MetaCart
systems Abstract. The technology for building knowledge-based systems by inductive inference from examples has been demonstrated successfully in several practical applications. This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail. Results from recent studies show ways in which the methodology can be modified to deal with information that is noisy and/or incomplete. A reported shortcoming of the basic algorithm is discussed and two means of overcoming it are compared. The paper concludes with illustrations of current research directions. 1.
Rules and exemplars in categorization, identification, and recognition
- Journal of Experimental Psychology: Learning, Memory, and Cognition
, 1989
"... Subjects learned to classify perceptual stimuli varying along continuous, separable dimensions into rule-described categories. The categories were designed to contrast the predictions of a selective-attention exemplar model and a simple rule-based model formalizing an economy-ofdescription view. Con ..."
Abstract
-
Cited by 40 (7 self)
- Add to MetaCart
Subjects learned to classify perceptual stimuli varying along continuous, separable dimensions into rule-described categories. The categories were designed to contrast the predictions of a selective-attention exemplar model and a simple rule-based model formalizing an economy-ofdescription view. Converging evidence about categorization strategies was obtained by also collecting identification and recognition data and by manipulating strategies via instructions. In free-strategy conditions, the exemplar model generally provided an accurate quantitative account of identification, categorization, and recognition performance, and it allowed for the interrelationship of these paradigms within a unified framework. Analyses of individual subject data also provided some evidence for the use of rules, but in general, the rules seemed to have a great deal in common with exemplar storage processes. Classification and recognition performance for subjects given explicit instructions to use specific rules contrasted dramatically with performance in the free-strategy conditions and could not be predicted by the exemplar model. Markedly different theoretical approaches have been applied to account for the learning and representation of welldefined categories structured according to simple rules and more natural, ill-defined categories (Rosch, 1973; E. E. Smith & Medin, 1981). In the case of well-defined categories, it is generally assumed that people formulate and test hypotheses concerning the "rules " that determine category membership
Techniques for Dealing with Missing Values in Classification
, 1997
"... . A brief overview of the history of the development of decision tree induction algorithms is followed by a review of techniques for dealing with missing attribute values in the operation of these methods. The technique of dynamic path generation is described in the context of treebased classificati ..."
Abstract
-
Cited by 19 (0 self)
- Add to MetaCart
. A brief overview of the history of the development of decision tree induction algorithms is followed by a review of techniques for dealing with missing attribute values in the operation of these methods. The technique of dynamic path generation is described in the context of treebased classification methods. The waste of data which can result from casewise deletion of missing values in statistical algorithms is discussed and alternatives proposed. Keywords: Missing values, Dynamic path generation, Intelligent data analysis, Inductive learning, Knowledge discovery, Data mining, Machine learning. 1 Introduction In the information age, data is generated almost everywhere: satellites orbiting the moons of Jupiter; submarines in the deepest ocean trench; even electronic point of sale machines in the high street produce data. All of these systems generate millions of megabytes of data every day. Some of these data contain information that could lead to important discoveries in science; s...
A Bayesian Framework for Concept Learning
- DEPARTMENT OF ARTIFICIAL INTELLIGENCE, EDINBURGH UNIVERSITY
, 1999
"... Human concept learning presents a version of the classic problem of induction, which is made particularly difficult by the combination of two requirements: the need to learn from a rich (i.e. nested and overlapping) vocabulary of possible concepts and the need to be able to generalize concepts reaso ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
Human concept learning presents a version of the classic problem of induction, which is made particularly difficult by the combination of two requirements: the need to learn from a rich (i.e. nested and overlapping) vocabulary of possible concepts and the need to be able to generalize concepts reasonably from only a few positive examples. I begin this thesis by considering a simple number concept game as a concrete illustration of this ability. On this task, human learners can with reasonable confidence lock in on one out of a billion billion billion logically possible concepts, after seeing only four positive examples of the concept, and can generalize informatively after seeing just a single example. Neither of the two classic approaches to inductive inference -- hypothesis testing in a constrained space of possible rules and computing similarity to the observed examples -- can provide a complete picture of how people generalize concepts in even this simple setting. This thesis prop...

