{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:32:56Z","timestamp":1754483576802,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030109271"},{"type":"electronic","value":"9783030109288"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10928-8_18","type":"book-chapter","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T08:19:39Z","timestamp":1548317979000},"page":"292-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Scalable Nonlinear AUC Maximization Methods"],"prefix":"10.1007","author":[{"given":"Majdi","family":"Khalid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indrakshi","family":"Ray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamidreza","family":"Chitsaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,23]]},"reference":[{"issue":"Apr","key":"18_CR1","first-page":"393","volume":"6","author":"S Agarwal","year":"2005","unstructured":"Agarwal, S., Graepel, T., Herbrich, R., Har-Peled, S., Roth, D.: Generalization bounds for the area under the roc curve. J. Mach. Learn. Res. 6(Apr), 393\u2013425 (2005)","journal-title":"J. Mach. Learn. Res."},{"issue":"9","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1016\/j.patrec.2011.03.014","volume":"32","author":"A Airola","year":"2011","unstructured":"Airola, A., Pahikkala, T., Salakoski, T.: Training linear ranking svms in linearithmic time using red-black trees. Pattern Recogn. Lett. 32(9), 1328\u20131336 (2011)","journal-title":"Pattern Recogn. Lett."},{"issue":"Jul","key":"18_CR3","first-page":"1737","volume":"10","author":"A Bordes","year":"2009","unstructured":"Bordes, A., Bottou, L., Gallinari, P.: SGD-QN: careful quasi-newton stochastic gradient descent. J. Mach. Learn. Res. 10(Jul), 1737\u20131754 (2009)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10791-009-9109-9","volume":"13","author":"O Chapelle","year":"2010","unstructured":"Chapelle, O., Keerthi, S.S.: Efficient algorithms for ranking with svms. Inf. Retrieval 13(3), 201\u2013215 (2010)","journal-title":"Inf. Retrieval"},{"unstructured":"Chaudhuri, S., Theocharous, G., Ghavamzadeh, M.: Recommending advertisements using ranking functions, uS Patent App. 14\/997,987, 18 Jan 2016","key":"18_CR5"},{"key":"18_CR6","first-page":"4629534","volume":"2017","author":"K Chen","year":"2017","unstructured":"Chen, K., Li, R., Dou, Y., Liang, Z., Lv, Q.: Ranking support vector machine with kernel approximation. Comput. Intell. Neurosci. 2017, 4629534 (2017)","journal-title":"Comput. Intell. Neurosci."},{"issue":"16","key":"18_CR7","first-page":"313","volume":"16","author":"C Cortes","year":"2004","unstructured":"Cortes, C., Mohri, M.: AUC optimization vs. error rate minimization. Adv. Neural Inf. Process. Syst. 16(16), 313\u2013320 (2004)","journal-title":"Adv. Neural Inf. Process. Syst."},{"doi-asserted-by":"crossref","unstructured":"Ding, Y., Liu, C., Zhao, P., Hoi, S.C.: Large scale kernel methods for online AUC maximization. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 91\u2013100. IEEE (2017)","key":"18_CR8","DOI":"10.1109\/ICDM.2017.18"},{"doi-asserted-by":"crossref","unstructured":"Ding, Y., Zhao, P., Hoi, S.C., Ong, Y.S.: An adaptive gradient method for online AUC maximization. In: AAAI, pp. 2568\u20132574 (2015)","key":"18_CR9","DOI":"10.1609\/aaai.v29i1.9577"},{"unstructured":"Gao, W., Jin, R., Zhu, S., Zhou, Z.H.: One-pass AUC optimization. In: ICML, vol. 3, pp. 906\u2013914 (2013)","key":"18_CR10"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","volume":"143","author":"JA Hanley","year":"1982","unstructured":"Hanley, J.A., McNeil, B.J.: The meaning and use of the area under a receiver operating characteristic (ROC) curve. Radiology 143(1), 29\u201336 (1982)","journal-title":"Radiology"},{"doi-asserted-by":"crossref","unstructured":"Hu, J., Yang, H., King, I., Lyu, M.R., So, A.M.C.: Kernelized online imbalanced learning with fixed budgets. In: AAAI, pp. 2666\u20132672 (2015)","key":"18_CR12","DOI":"10.1609\/aaai.v29i1.9587"},{"doi-asserted-by":"crossref","unstructured":"Joachims, T.: A support vector method for multivariate performance measures. In: Proceedings of the 22nd International Conference on Machine Learning, pp. 377\u2013384. ACM (2005)","key":"18_CR13","DOI":"10.1145\/1102351.1102399"},{"doi-asserted-by":"crossref","unstructured":"Joachims, T.: Training linear SVMs in linear time. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 217\u2013226. ACM (2006)","key":"18_CR14","DOI":"10.1145\/1150402.1150429"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/1.9781611974973.33","volume-title":"Proceedings of the 2017 SIAM International Conference on Data Mining","author":"Vishal Kakkar","year":"2017","unstructured":"Kakkar, V., Shevade, S., Sundararajan, S., Garg, D.: A sparse nonlinear classifier design using AUC optimization. In: Proceedings of the 2017 SIAM International Conference on Data Mining, pp. 291\u2013299. SIAM (2017)"},{"issue":"Jul","key":"18_CR16","first-page":"1493","volume":"7","author":"SS Keerthi","year":"2006","unstructured":"Keerthi, S.S., Chapelle, O., DeCoste, D.: Building support vector machines with reduced classifier complexity. J. Mach. Learn. Res. 7(Jul), 1493\u20131515 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-49586-6_3","volume-title":"Advanced Data Mining and Applications","author":"M Khalid","year":"2016","unstructured":"Khalid, M., Ray, I., Chitsaz, H.: Confidence-weighted bipartite ranking. In: Li, J., Li, X., Wang, S., Li, J., Sheng, Q.Z. (eds.) ADMA 2016. LNCS (LNAI), vol. 10086, pp. 35\u201349. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49586-6_3"},{"unstructured":"Kotlowski, W., Dembczynski, K.J., Huellermeier, E.: Bipartite ranking through minimization of univariate loss. In: Proceedings of the 28th International Conference on Machine Learning (ICML-11), pp. 1113\u20131120 (2011)","key":"18_CR18"},{"unstructured":"Kumar, S., Mohri, M., Talwalkar, A.: Ensemble nystrom method. In: Advances in Neural Information Processing Systems, pp. 1060\u20131068 (2009)","key":"18_CR19"},{"doi-asserted-by":"crossref","unstructured":"Kuo, T.M., Lee, C.P., Lin, C.J.: Large-scale kernel RankSVM. In: Proceedings of the 2014 SIAM International Conference on Data Mining, pp. 812\u2013820. SIAM (2014)","key":"18_CR20","DOI":"10.1137\/1.9781611973440.93"},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1162\/NECO_a_00571","volume":"26","author":"CP Lee","year":"2014","unstructured":"Lee, C.P., Lin, C.J.: Large-scale linear rankSVM. Neural Comput. 26(4), 781\u2013817 (2014)","journal-title":"Neural Comput."},{"issue":"3","key":"18_CR22","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"TY Liu","year":"2009","unstructured":"Liu, T.Y.: Learning to rank for information retrieval. Found. Trends Inf. Retrieval 3(3), 225\u2013331 (2009)","journal-title":"Found. Trends Inf. Retrieval"},{"issue":"4","key":"18_CR23","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"BT Polyak","year":"1992","unstructured":"Polyak, B.T., Juditsky, A.B.: Acceleration of stochastic approximation by averaging. SIAM J. Control Optim. 30(4), 838\u2013855 (1992)","journal-title":"SIAM J. Control Optim."},{"unstructured":"Rahimi, A., Recht, B.: Random features for large-scale kernel machines. In: Advances in Neural Information Processing Systems, pp. 1177\u20131184 (2008)","key":"18_CR24"},{"doi-asserted-by":"crossref","unstructured":"Rendle, S., Balby Marinho, L., Nanopoulos, A., Schmidt-Thieme, L.: Learning optimal ranking with tensor factorization for tag recommendation. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 727\u2013736. ACM (2009)","key":"18_CR25","DOI":"10.1145\/1557019.1557100"},{"unstructured":"Root, J., Qian, J., Saligrama, V.: Learning efficient anomaly detectors from K-NN graphs. In: Artificial Intelligence and Statistics, pp. 790\u2013799 (2015)","key":"18_CR26"},{"unstructured":"Sculley, D.: Large scale learning to rank. In: NIPS Workshop on Advances in Ranking, pp. 58\u201363 (2009)","key":"18_CR27"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-319-71246-8_35","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"B Sz\u00f6r\u00e9nyi","year":"2017","unstructured":"Sz\u00f6r\u00e9nyi, B., Cohen, S., Mannor, S.: Non-parametric Online AUC Maximization. In: Ceci, M., Hollm\u00e9n, J., Todorovski, L., Vens, C., D\u017eeroski, S. (eds.) ECML PKDD 2017. LNCS (LNAI), vol. 10535, pp. 575\u2013590. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71246-8_35"},{"unstructured":"Xu, W.: Towards optimal one pass large scale learning with averaged stochastic gradient descent. arXiv preprint arXiv:1107.2490 (2011)","key":"18_CR29"},{"unstructured":"Ying, Y., Wen, L., Lyu, S.: Stochastic online AUC maximization. In: Advances in Neural Information Processing Systems, pp. 451\u2013459 (2016)","key":"18_CR30"},{"doi-asserted-by":"crossref","unstructured":"Zhang, K., Tsang, I.W., Kwok, J.T.: Improved nystr\u00f6m low-rank approximation and error analysis. In: Proceedings of the 25th International Conference on Machine Learning, pp. 1232\u20131239. ACM (2008)","key":"18_CR31","DOI":"10.1145\/1390156.1390311"},{"unstructured":"Zhao, P., Jin, R., Yang, T., Hoi, S.C.: Online AUC maximization. In: Proceedings of the 28th International Conference on Machine Learning (ICML-11), pp. 233\u2013240 (2011)","key":"18_CR32"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10928-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T01:05:29Z","timestamp":1705885529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10928-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030109271","9783030109288"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10928-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ecmlpkdd2018.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"535","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}