Learning to Rank by Maximizing AUC with Linear Programming

— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approximating the equivalent Wicoxon-Mann-Whitney (WMW) statistic. We present a linear programming approach similar to 1-norm Support Vector Machines (SVMs) for instance ranking by an approximation to the WMW statistic. Our formulation can be applied to nonlinear problems by using a kernel function. Our ranking algorithm outperforms SVMs in both AUC and classification performance when using RBF kernels, but curiously not with polynomial kernels. We experiment with variations of chunking to handle the quadratic growth of the number of constraints in our formulation.

• Type: Conference
• Year: 2006
• Where: IJCNN
• Authors: Kaan Ataman, W. Nick Street, Yi Zhang
• Keywords: Algorithm Outperforms Svms, Binary Classification Problems, IJCNN 2006, Ranking