The combination of classifiers is an established technique to improve the classification performance. The combination rules proposed up to now generally try to decrease the classification error rate, which is a performance measure not suitable in many real situations and particularly when dealing with two class problems. In this case, a good alternative is given by the Area under the Receiver Operating Characteristic curve (AUC). This paper presents a method for the linear combination of two-class classifiers aimed at maximizing the AUC. The effectiveness of the approach has been confirmed by the tests performed on standard datasets.


Receiver Operating Characteristic Curve Sequential Quadratic Programming Combination Rule Greedy Approach Classification Error Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Fumera, G., Roli, F.: A Theoretical and Experimental Analysis of Linear Combiners for Multiple Classifier Systems. IEEE Trans. on Patt. Anal. and Mach. Intell. 27(6), 942–956 (2005)CrossRefGoogle Scholar
  2. 2.
    Provost, F., Fawcett, T., Kohavi, R.: The Case against Accuracy Estimation for Comparing Induction Algorithms. In: Proc. ICML 1998, pp. 445–453. Morgan Kaufmann, San Francisco (1998)Google Scholar
  3. 3.
    Huang, J., Ling, C.X.: Using AUC and Accuracy in Evaluating Learning Algorithms. IEEE Transactions on Knowledge and Data Engineering 17, 299–310 (2005)CrossRefMATHGoogle Scholar
  4. 4.
    Webb, A.: Statistical pattern Recognition, 2nd edn. Wiley, USA (2002)MATHCrossRefGoogle Scholar
  5. 5.
    Pepe, M.: The Statistical Evaluation of Medical Tests for Classification and Prediction. Oxford University Press, Oxford, UK (2003)Google Scholar
  6. 6.
    Lehmann, E.L.: Nonparametrics. In: Statistical Methods Based on Ranks. Holden Day, S. Francisco (1975)Google Scholar
  7. 7.
    Hanley, J.A., McNeil, B.J.: The Meaning and the Use of the Area under a Receiver Operating Characteristic Curve. Radiology 143, 29–36 (1982)Google Scholar
  8. 8.
    Blake, C., Keogh, E., Merz, C.J.: UCI Repository of Machine Learning Databases (1998),
  9. 9.
    Joachims, T.: Making Large-Scale SVM Learning Practical. In: Schölkopf, B., Burges, C.J.C., Smola, A.J. (eds.) Advances in Kernel Methods, pp. 169–184. MIT Press, Cambridge (1999)Google Scholar
  10. 10.
    Flake, G.W., Pearlmuter, B.A.: Differentiating Functions of the Jacobian with Respect to the Weights. In: Solla, S.A., Leen, T.K., Müller, K. (eds.) Advances in Neural Information Processing Systems, vol. 12. The MIT Press, Cambridge (2000)Google Scholar
  11. 11.
    Huyer, W., Neumaier, A.: Global optimization by multilevel coordinate search. J. Global Optimization 14, 331–355 (1999)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Claudio Marrocco
    • 1
  • Mario Molinara
    • 1
  • Francesco Tortorella
    • 1
  1. 1.Dipartimento di Automazione, Elettromagnetismo, Ingegneria dell’Informazione e Matematica IndustrialeUniversità degli Studi di CassinoCassino (FR)Italy

Personalised recommendations