Abstract
We introduce an instance-weighting method to induce cost-sensitive trees. It is a generalization of the standard tree induction process where only the initial instance weights determine the type of tree to be induced-minimum error trees or minimum high cost error trees. We demonstrate that it can be easily adapted to an existing tree learning algorithm. Previous research provides insufficient evidence to support the idea that the greedy divide-and-conquer algorithm can effectively induce a truly cost-sensitive tree directly from the training data. We provide this empirical evidence in this paper. The algorithm incorporating the instance-weighting method is found to be better than the original algorithm in in of total misclassification costs, the number of high cost errors, and tree size two-class data sets. The instance-weighting method is simpler and more effective in implementation than a previous method based on altered priors.
Keywords
WeightingComputer scienceTree (set theory)GeneralizationAlgorithmData miningMachine learningMathematical optimizationArtificial intelligenceMathematics
Affiliated Institutions
Related Publications
Cost-sensitive learning by cost-proportionate example weighting
We propose and evaluate a family of methods for converting classifier learning algorithms and classification theory into cost-sensitive algorithms and theory. The proposed conve...
A further comparison of splitting rules for decision-tree induction
One approach to learning classification rules from examples is to build decision trees. A review and comparison paper by Mingers (Mingers, 1989) looked at the first stage of tre...
ROC Curves for Classification Trees
A common problem in medical diagnosis is to combine information from several tests or patient characteristics into a decision rule to distinguish diseased from healthy patients....
Quickly Boosting Decision Trees - Pruning Underachieving Features Early
Boosted decision trees are one of the most popular and successful learning techniques used today. While exhibiting fast speeds at test time, relatively slow training makes them ...
The random subspace method for constructing decision forests
Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Publication Info
- Year
- 2002
- Type
- article
- Volume
- 14
- Issue
- 3
- Pages
- 659-665
- Citations
- 491
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
491
OpenAlex
Cite This
Kai Ming Ting
(2002).
An instance-weighting method to induce cost-sensitive trees.
IEEE Transactions on Knowledge and Data Engineering
, 14
(3)
, 659-665.
https://doi.org/10.1109/tkde.2002.1000348
Identifiers
- DOI
- 10.1109/tkde.2002.1000348