{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T14:55:35Z","timestamp":1771685735039,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030461324","type":"print"},{"value":"9783030461331","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-46133-1_15","type":"book-chapter","created":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T07:08:58Z","timestamp":1588230538000},"page":"237-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Pairwise Learning to Rank by Neural Networks Revisited: Reconstruction, Theoretical Analysis and Practical Performance"],"prefix":"10.1007","author":[{"given":"Marius","family":"K\u00f6ppel","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Segner","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Wagener","sequence":"additional","affiliation":[]},{"given":"Lukas","family":"Pensel","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Karwath","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Kramer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"15_CR1","unstructured":"Abadi, M., et al.: TensorFlow: large-scale machine learning on heterogeneous systems (2015). http:\/\/tensorflow.org\/"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Burges, C., et al.: Learning to rank using gradient descent. In: Proceedings of the 22nd International Conference on Machine Learning, ICML 2005, pp. 89\u201396. ACM, New York (2005). http:\/\/doi.acm.org\/10.1145\/1102351.1102363","DOI":"10.1145\/1102351.1102363"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Burges, C., Ragno, R., Le, Q., Burges, C.J.: Learning to rank with non-smooth cost functions. In: Advances in Neural Information Processing Systems 19. MIT Press, Cambridge, January 2007. https:\/\/www.microsoft.com\/en-us\/research\/publication\/learning-to-rank-with-non-smooth-cost-functions\/","DOI":"10.7551\/mitpress\/7503.003.0029"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Cao, Y., Xu, J., Liu, T.Y., Li, H., Huang, Y., Hon, H.W.: Adapting ranking SVM to document retrieval. In: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 186\u2013193. ACM (2006). https:\/\/doi.org\/10.1145\/1148170.1148205","DOI":"10.1145\/1148170.1148205"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: from pairwise approach to listwise approach, p. 9, April 2007. https:\/\/www.microsoft.com\/en-us\/research\/publication\/learning-to-rank-from-pairwise-approach-to-listwise-approach\/","DOI":"10.1145\/1273496.1273513"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Cooper, W.S., Gey, F.C., Dabney, D.P.: Probabilistic retrieval based on staged logistic regression. In: Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 198\u2013210. ACM (1992). http:\/\/doi.acm.org\/10.1145\/133160.133199","DOI":"10.1145\/133160.133199"},{"key":"15_CR7","unstructured":"Freund, Y., Iyer, R., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. J. Mach. Learn. Res. 4(Nov), 933\u2013969 (2003). http:\/\/dl.acm.org\/citation.cfm?id=945365.964285"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29, 1189\u20131232 (2000). http:\/\/www.jstor.org\/stable\/2699986","DOI":"10.1214\/aos\/1013203451"},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/65943.65944","volume":"7","author":"N Fuhr","year":"1989","unstructured":"Fuhr, N.: Optimum polynomial retrieval functions based on the probability ranking principle. ACM Trans. Inf. Syst. (TOIS) 7(3), 183\u2013204 (1989)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Herbrich, R., Graepel, T., Obermayer, K.: Large margin rank boundaries for ordinal regression. In: Advances in Large Margin Classifiers, pp. 115\u2013132 (2000)","DOI":"10.7551\/mitpress\/1113.003.0010"},{"issue":"5","key":"15_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K Hornik","year":"1989","unstructured":"Hornik, K., Stinchcombe, M., White, H.: Multilayer feedforward networks are universal approximators. Neural Netw. 2(5), 359\u2013366 (1989). https:\/\/doi.org\/10.1016\/0893-6080(89)90020-8","journal-title":"Neural Netw."},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Ibrahim, O.A.S., Landa-Silva, D.: ES-Rank: evolution strategy learning to rank approach. In: Proceedings of the Symposium on Applied Computing, pp. 944\u2013950. ACM (2017). https:\/\/doi.org\/10.1145\/3019612.3019696","DOI":"10.1145\/3019612.3019696"},{"issue":"10","key":"15_CR13","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1007\/s00500-017-2988-6","volume":"22","author":"OAS Ibrahim","year":"2018","unstructured":"Ibrahim, O.A.S., Landa-Silva, D.: An evolutionary strategy with machine learning for learning to rank in information retrieval. Soft Comput. 22(10), 3171\u20133185 (2018). https:\/\/doi.org\/10.1007\/s00500-017-2988-6","journal-title":"Soft Comput."},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10115-008-0173-z","volume":"20","author":"L Jiang","year":"2009","unstructured":"Jiang, L., Li, C., Cai, Z.: Learning decision tree for ranking. Knowl. Inf. Syst. 20(1), 123\u2013135 (2009)","journal-title":"Knowl. Inf. Syst."},{"key":"15_CR15","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"15_CR16","unstructured":"Li, P., Wu, Q., Burges, C.J.: McRank: learning to rank using multiple classification and gradient boosting. In: Advances in Neural Information Processing Systems, pp. 897\u2013904 (2008)"},{"issue":"3","key":"15_CR17","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. Retr. 3(3), 225\u2013331 (2009). https:\/\/doi.org\/10.1561\/1500000016","journal-title":"Found. Trends Inf. Retr."},{"key":"15_CR18","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"15_CR19","unstructured":"Qin, T., Liu, T.: Introducing LETOR 4.0 datasets. CoRR abs\/1306.2597 (2013). http:\/\/arxiv.org\/abs\/1306.2597"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/978-3-540-87559-8_93","volume-title":"Artificial Neural Networks - ICANN 2008","author":"L Rigutini","year":"2008","unstructured":"Rigutini, L., Papini, T., Maggini, M., Bianchini, M.: A neural network approach for learning object ranking. In: K\u016frkov\u00e1, V., Neruda, R., Koutn\u00edk, J. (eds.) ICANN 2008. LNCS, vol. 5164, pp. 899\u2013908. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87559-8_93"},{"key":"15_CR21","unstructured":"Croft, W.B., Callan, J.: Lemur toolkit (2001\u20132012). http:\/\/lemurproject.org\/contrib.php"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Wu, Q., Burges, C.J., Svore, K.M., Gao, J.: Adapting boosting for information retrieval measures. Inf. Retr. 13, 254\u2013270 (2010). https:\/\/www.microsoft.com\/en-us\/research\/publication\/adapting-boosting-for-information-retrieval-measures\/","DOI":"10.1007\/s10791-009-9112-1"},{"key":"15_CR23","doi-asserted-by":"publisher","unstructured":"Xu, J., Li, H.: AdaRank: a boosting algorithm for information retrieval. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2007, pp. 391\u2013398. ACM, New York (2007). https:\/\/doi.org\/10.1145\/1277741.1277809","DOI":"10.1145\/1277741.1277809"}],"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-46133-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:03:52Z","timestamp":1745964232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46133-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461324","9783030461331"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46133-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","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":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"733","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":"130","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":"0","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":"18% - 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.04","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":"5.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}