AUC maximizing support vector machines with feature selection

Yingjie Tian, Yong Shi, Xiaojun Chen, Wenjing Chen

Research output: Journal article publicationConference articleAcademic researchpeer-review

7 Citations (Scopus)


In this paper, we proposed a new algorithm, the Sparse AUC maximizing support vector machine, to get more sparse features and higher AUC than standard SVM. By applying p-norm where 0 < p < 1 to the weight w of the separating hyperplane (w · x) + b = 0, the new algorithm can delete less important features corresponding to smaller |w|. Besides, by applying the AUC maximizing objective function, the algorithm can get higher AUC which make the decision function have higher prediction ability. Experiments demonstrate the new algorithm's effectiveness. Some contributions as follows: (1) the algorithm optimizes AUC instead of accuracy; (2) incorporating feature selection into the classification process; (3) conduct experiments to demonstrate the performance.
Original languageEnglish
Pages (from-to)1691-1698
Number of pages8
JournalProcedia Computer Science
Publication statusPublished - 15 Jun 2011
Event11th International Conference on Computational Science, ICCS 2011 - Singapore, Singapore
Duration: 1 Jun 20113 Jun 2011


  • AUC
  • Feature selection
  • P-norm
  • Support vector machine

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'AUC maximizing support vector machines with feature selection'. Together they form a unique fingerprint.

Cite this