1. Airola, A., Pahikkala, T., Salakoski, T.: Training linear ranking svms in linearithmic time using red{black trees. Pattern Recognition Letters 32(9), 1328{1336 (2011)

2. Bordes, A., Bottou, L., Gallinari, P.: Sgd-qn: Careful quasi-newton stochastic gradient descent. Journal of Machine Learning Research 10(Jul), 1737{1754 (2009)

3. Chapelle, O., Keerthi, S.S.: E cient algorithms for ranking with svms. Information Retrieval 13(3), 201{215 (2010)

4. Chaudhuri, S., Theocharous, G., Ghavamzadeh, M.: Recommending advertisements using ranking functions (Jan 18 2016), uS Patent App. 14/997,987

5. Cortes, C., Mohri, M.: Auc optimization vs. error rate minimization. Advances in neural information processing systems 16(16), 313{320 (2004)

6. Felix, X.Y., Kumar, S., Rowley, H., Chang, S.F.: Compact nonlinear maps and circulant extensions. stat 1050, 12 (2015)

7. Gao, W., Jin, R., Zhu, S., Zhou, Z.H.: One-pass auc optimization. In: ICML (3). pp. 906{914 (2013)

8. Gu, Q., Han, J.: Clustered support vector machines. In: Arti cial Intelligence and Statistics. pp. 307{315 (2013)

9. Hanley, J.A., McNeil, B.J.: The meaning and use of the area under a receiver operating characteristic (roc) curve. Radiology 143(1), 29{36 (1982)

10. Herschtal, A., Raskutti, B.: Optimising area under the roc curve using gradient descent. In: Proceedings of the twenty- rst international conference on Machine learning. p. 49. ACM (2004)