Boosting Inspired Process for Improving AUC
Boosting is a general method of combining a set of classifiers in making final prediction. It is shown to be an effective approach to improve the predictive accuracy of a learning algorithm, but its impact on the ranking performance is unknown. This paper introduces the boosting algorithm AUCBoost, which is a generic algorithm to improve the ranking performance of learning algorithms. Unlike AdaBoost, AUCBoost uses the AUC, not the accuracy, of a classifier to calculate the weight of each training example for building next classifier. To simplify the computation of AUC of weighted instances in AUCBoost, we extend the standard formula for calculating AUC to be a weighted AUC formula (WAUC in short). This extension frees boosting from the resampling process and saves much computation time in the training process. Our experiment results show that the new boosting algorithm AUCBoost does improve ranking performance of AdaBoost when the base learning algorithm is the improved ranking favored decision tree C4.4 or naïve Bayes.
Keywordsboosting AUCBoost AUC classification inductive learning decision tree naïve bayes data mining machine learning
Unable to display preview. Download preview PDF.
- 1.Elkan, C.: Boosting and Naïve Bayesian Learning, Technical Report No. CS97-557, University of California, SanDiego (1997)Google Scholar
- 2.Fayyad, U., Irani, K.: Multi-interval Discretization of Continuous-valued attributes for Classification Learning. In: Proceeding of Thirteenth International Joint Conference on Artificial Intelligence, pp. 1022–1027. Morgan Kaufmann, San Francisco (1993)Google Scholar
- 6.Kohavi, R.: A Study of Cross Validation and Bootstrap for Accuracy Estimation and Model Selection. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 338–345. Morgan Kaufmann, San Francisco (1995)Google Scholar
- 7.Ling, C., Huang, J., Zhang, H.: AUC: a Statistically Consistent and more Discriminating Measure than Accuracy. In: Proceedings of International Joint Conference on Artificial Intelligence, pp. 329–341 (2003)Google Scholar
- 8.Margineantu, D.D., Dietterich, T.G.: Improved Class Probability Estimates from Decision Tree Models. In: Denison, D.D., Hansen, M.H., Holmes, C.C., Mallick, B., Yu, B. (eds.) Nonlinear Estimation and Classification. Lecture Notes in Statistics, vol. 171, pp. 169–184. Springer, New York (2002)Google Scholar
- 12.Quinlan, J.R.: Induction of Decision Trees. Machine Learning 1(1), 86–106 (1986)Google Scholar