Evaluating boosting algorithms to classify rare classes: comparison and improvements
- 14 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1572, 257-264
- https://doi.org/10.1109/icdm.2001.989527
Abstract
Classification of rare events has many important data mining applications. Boosting is a promising meta-technique that improves the classification performance of any weak classifier. So far, no systematic study has been conducted to evaluate how boosting performs for the task of mining rare classes. The authors evaluate three existing categories of boosting algorithms from the single viewpoint of how they update the example weights in each iteration, and discuss their possible effect on recall and precision of the rare class. We propose enhanced algorithms in two of the categories, and justify their choice of weight updating parameters theoretically. Using some specially designed synthetic datasets, we compare the capability of all the algorithms from the rare class perspective. The results support our qualitative analysis, and also indicate that our enhancements bring an extra capability for achieving better balance between recall and precision in mining rare classes.Keywords
This publication has 6 references indexed in Scilit:
- Evaluating boosting algorithms to classify rare classes: comparison and improvementsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Mining needle in a haystackPublished by Association for Computing Machinery (ACM) ,2001
- An improved boosting algorithm and its application to text categorizationPublished by Association for Computing Machinery (ACM) ,2000
- Theoretical Views of BoostingPublished by Springer Nature ,1999
- Improved Boosting Algorithms Using Confidence-rated PredictionsMachine Learning, 1999
- Fast Effective Rule InductionPublished by Elsevier ,1995