An SE-tree based Characterization of the Induction Problem
Elsevier eBooksPublished 1 January 1993
Ron Rymon
Citations63
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper proposes a new structure, called SE-tree, as a more general alternative to decision trees, used in induction programs both as the basis for their search, and as a representation of their classifier solution.
Abstract
Many induction programs use decision trees both as the basis for their search, and as a representation of their classifier solution. In this paper we propose a new structure, called SE-tree, as a more general alternative.
Keywords
Computer Science
Machine LearningInduction of Decision Trees
14,815 Citations1986J. R. Quinlan
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, which is described in detail.
Machine LearningInduction of decision trees
12,383 Citations1986J. R. Quinlan
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, which is described in detail.
Machine LearningLearning Decision Lists
761 Citations1987Ronald L. Rivest
This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples, and strictly increases the set of functions known to be polynomially learnable, in the sense of Valiant (1984).
Generating production rules from decision trees
474 Citations1987J. R. Quinlan
This paper describes a technique for transforming such trees to small sets of production rules, a common formalism for expressing knowledge in expert systems, and provides a way of combining different decision trees for the same classification domain.
Machine LearningBoolean Feature Discovery in Empirical Learning
398 Citations1990Giulia Pagallo, David Haussler
Two new methods that adaptively introduce relevant features while learning a decision tree from examples are presented, showing empirically that these methods outperform a standard decision tree algorithm for learning small random DNF functions when the examples are drawn at random from the uniform distribution.
Machine LearningLearning decision lists
355 Citations1987Ronald L. Rivest
This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples, and strictly increases the set of functions known to be polynomially learnable, in the sense of Valiant (1984).
ScholarlyCommons (University of Pennsylvania)Search through systematic set enumeration
334 Citations1992Ron Rymon
The Set-Enumerations (SE)tree is presented as a vehicle for representing sets and/or enumerating them in a best-first fashion and its usefulness as the basis for a unifying search-based framework for domains where minimal (maximal) elements of a power set are targeted.
Reduced complexity rule induction
63 Citations1991Sholom M. Weiss, Nitin Indurkhya
It is shown that far simpler decision rules can be found with predictive performance that exceeds those previously reported for various learning models, including neural nets and decision trees.
Learning classification trees
60 Citations1993Wray Buntine
Artificial IntelligenceDepth-first heuristic search on a SIMD machine
47 Citations1993Curt Powley, Chris Ferguson +1 more
This work presents a parallel implementation of Iterative-Deepening-A, a depth-first heuristic search, on the single-instruction, multiple-data (SIMD) Connection Machine, and indicates that work only needs to increase as P log P to maintain constant efficiency.
Linear-space best-first search: summary of results
29 Citations1992Richard E. Korf
RBFS reduces the space complexity of best-first search from exponential to linear, at the cost of only a constant factor in time complexity in the authors' experiments.
NASA Technical Reports Server (NASA)Myths and legends in learning classification rules
27 Citations1990Wray Buntine
Six myths in the machine learning community that address issues of bias, learning as search, computational learning theory, Occam's razor, "universal" learning algorithms, and interactive learning are proposed.