Cost-sensitive specialization
Lecture notes in computer sciencePublished 1 January 1996
Geoffrey I. Webb
Citations17
SJR quartileQ2
SJR score0.35
SNIP0.55
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
Experimental evaluation demonstrates consistent positive effects over a range of misclassification cost sensitive learning tasks and could be used to augment the effect of standard cost-sensitive induction techniques.
Abstract
Cost-sensitive specialization is a generic technique for mis-classification cost sensitive induction. This technique involves specializing aspects of a classifier associated with high misclassification costs and generalizing those associated with low misclassification costs. It is widely applicable and simple to implement. It could be used to augment the effect of standard cost-sensitive induction techniques. It should directly extend to test application cost sensitive induction tasks. Experimental evaluation demonstrates consistent positive effects over a range of misclassification cost sensitive learning tasks.
Keywords
Computer Science
BiometricsClassification and Regression Trees.
23,841 Citations1984Alexander Gordon, Leo Breiman +3 more
C4.5: Programs for Machine Learning
23,665 Citations1992J. R. Quinlan
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Programs for Machine Learning
5,794 Citations1994Steven L. Salzberg, Alberto M. Segre
In his new book, C4.5: Programs for Machine Learning, Quinlan has put together a definitive, much needed description of his complete system, including the latest developments, which will be a welcome addition to the library of many researchers and students.
Journal of Artificial Intelligence ResearchCost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm
576 Citations1995Peter D. Turney
This paper introduces ICET, a new algorithm for cost-sensitive classification that uses a genetic algorithm to evolve a population of biases for a decision tree induction algorithm and establishes that ICET performs significantly better than its competitors.
Elsevier eBooksReducing Misclassification Costs
343 Citations1994Michael J. Pazzani, Christopher J. Merz +4 more
Algorithms for learning classification procedures that attempt to minimize the cost of misclassifying examples are explored and the Reduced Cost Ordering algorithm, a new method for creating a decision list, is described and compared to a variety of inductive learning approaches.
Concept learning and the problem of small disjuncts
342 Citations1989Robert C. Holte, Liane Acker +1 more
Various approaches to this problem are evaluated, including the novel approach of using a bias different than the "maximum generality" bias, which prove partly successful, but the problem of small disjuncts remains open.
Machine LearningThe Use of Background Knowledge in Decision Tree Induction
196 Citations1991Marlon Núñez
The algorithm presented in this paper tries to generate more logical and understandable decision trees than those generated by ID3-like algorithms; it executes various types of generalization and at the same time reduces the classification cost by means of background knowledge.
Machine LearningCost-Sensitive Learning of Classification Knowledge and Its Applications in Robotics
136 Citations1993Ming Tan
A unified framework for learning-from-examples methods that trade off accuracy for efficiency during learning is proposed, and two methods (CS-ID3 and CS-IBL) are analyzed in detail.
Machine LearningThe use of background knowledge in decision tree induction
114 Citations1991Marlon N��ez
The algorithm presented in this paper tries to generate more logical and understandable decision trees than those generated by ID3-like algorithms; it executes various types of generalization and at the same time reduces the classification cost by means of background knowledge.
Journal of Artificial Intelligence ResearchFurther Experimental Evidence against the Utility of Occam's Razor
110 Citations1996Geoffrey I. Webb
A systematic procedure derived by rejecting Occam's razor and instead attending to the assumption that similar objects are likely to belong to the same class increases a decision tree's complexity without altering the performance of that tree on the training data from which it is inferred.
International Joint Conference on Artificial IntelligenceGenerating better decision trees
106 Citations1989Steven W. Norton
A new decision tree learning algorithm called IDX is described, more general than existing algorithms, that addresses issues of decision tree quality largely overlooked in the artificial intelligence and machine learning literature.
Machine LearningInductive policy: The pragmatics of bias selection
88 Citations1995Foster Provost, Bruce G. Buchanan
A framework for representing and automatically selecting a wide variety of biases is presented and experiments with an instantiation of the framework addressing various pragmatic tradeoffs of time, space, accuracy, and the cost of errors are described.
Machine LearningCost-sensitive learning of classification knowledge and its applications in robotics
75 Citations1993Ming Tan
A unified framework for learning-from-examples methods that trade off accuracy for efficiency during learning is proposed, and two methods (CS-ID3 and CS-IBL) are analyzed in detail.
Lecture notes in computer scienceCost-sensitive pruning of decision trees
69 Citations1994Ulrich Knoll, Gholamreza Nakhaeizadeh +1 more
This paper shows how the misclassification costs, a related criterion applied if errors vary in their costs, can be integrated in several well-known pruning techniques.
IEEE Transactions on Pattern Analysis and Machine IntelligenceGoal-directed classification using linear machine decision trees
57 Citations1994Bruce A. Draper, Carla E. Brodley +1 more
This correspondence reviews the linear machine decision tree (LMDT) algorithm for inducing multivariate decision trees, and shows how LMDT can be altered to induce decision trees that minimize arbitrary misclassification cost functions (MCF's).
Computational IntelligenceExplicitly biased generalization
35 Citations1989Diana F. Gordon, Donald Perlis
This paper describes the use of the third method of incremental concept learning from examples, where bias is represented explicitly both as assumptions that reduce the space of potential hypotheses and as procedures for testing these assumptions.
National Conference on Artificial IntelligenceInductive policy
27 Citations1992Foster Provost, Bruce G. Buchanan
Goal-Directed Inductive Learning: Trading off Accuracy for Reduced Error Cost
13 Citations1994Foster Provost
It is shown that inductive learning can trade off classification accuracy for a reduction in cost, when the learning program uses a cost function to evaluate its learned knowledge.
Machine LearningInductive Policy: The Pragmatics of Bias Selection
7 Citations1995Foster Provost, Bruce G. Buchanan
A framework for representing and automatically selecting a wide variety of biases is presented and experiments with an instantiation of the framework addressing various pragmatic tradeoffs of time, space, accuracy, and the cost of errors are described.