Efficient AUC maximization with regularized least-squares

Tapio Pahikkala, Antti Airola, Hanna Suominen, Jorma Boberg, Tapio I. Salakoski

Research output: A Conference proceeding or a Chapter in BookConference contribution

4 Citations (Scopus)

Abstract

Area under the receiver operating characteristics curve (AUC) is a popular measure for evaluating the quality of binary classifiers, and intuitively, machine learning algorithms that maximize an approximation of AUC should have a good AUC performance when classifying new examples. However, designing such algorithms in the framework of kernel methods has proven to be challenging. In this paper, we address AUC maximization with the regularized least-squares (RLS) algorithm also known as the least-squares support vector machine. First, we introduce RLStype binary classifier that maximizes an approximation of AUC and has a closedform solution. Second, we show that this AUC-RLS algorithm is computationally as efficient as the standard RLS algorithm that maximizes an approximation of the accuracy. Third, we compare the performance of these two algorithms in the task of assigning topic labels for newswire articles in terms of AUC. Our algorithm outperforms the standard RLS in every classification experiment conducted. The performance gains are most substantial when the distribution of the class labels is unbalanced. In conclusion, modifying the RLS algorithm to maximize the approximation of AUC does not increase the computational complexity, and this alteration enhances the quality of the classifier.

Original languageEnglish
Title of host publicationProceedings of the 2008 Conference on 10th Scandinavian Conference on Artificial Intelligence: SCAI 2008
EditorsAnders Holst, Per Kreuger, Peter Funk
Place of PublicationUnited States
PublisherIOS Press
Pages12-19
Number of pages8
Volume173
ISBN (Print)9781586038670
Publication statusPublished - 2008
Externally publishedYes
Event10th Scandinavian Conference on Artificial Intelligence - Stockholm, Stockholm, Sweden
Duration: 26 May 200828 May 2008

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume173
ISSN (Print)09226389

Conference

Conference10th Scandinavian Conference on Artificial Intelligence
Abbreviated titleSCAI 2008
CountrySweden
CityStockholm
Period26/05/0828/05/08

Fingerprint Dive into the research topics of 'Efficient AUC maximization with regularized least-squares'. Together they form a unique fingerprint.

  • Cite this

    Pahikkala, T., Airola, A., Suominen, H., Boberg, J., & Salakoski, T. I. (2008). Efficient AUC maximization with regularized least-squares. In A. Holst, P. Kreuger, & P. Funk (Eds.), Proceedings of the 2008 Conference on 10th Scandinavian Conference on Artificial Intelligence: SCAI 2008 (Vol. 173, pp. 12-19). (Frontiers in Artificial Intelligence and Applications; Vol. 173). IOS Press. https://dl.acm.org/citation.cfm?id=1566868