@inproceedings{40a88570f7334176a416080e010cb0fb,

title = "Boosting inspired process for improving AUC",

abstract = "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{\"i}ve Bayes.",

keywords = "AUC, AUCBoost, boosting, classification, data mining, decision tree, inductive learning, machine learning, na{\"i}ve bayes",

author = "Sheng, {Victor S.} and Rahul Tada",

note = "Copyright: Copyright 2011 Elsevier B.V., All rights reserved.; null ; Conference date: 30-08-2011 Through 03-09-2011",

year = "2011",

doi = "10.1007/978-3-642-23199-5_15",

language = "English",

isbn = "9783642231988",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "199--209",

booktitle = "Machine Learning and Data Mining in Pattern Recognition - 7th International Conference, MLDM 2011, Proceedings",

}