{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:43Z","timestamp":1750306543191,"version":"3.41.0"},"publisher-location":"Republic and Canton of Geneva, Switzerland","reference-count":42,"publisher":"International World Wide Web Conferences Steering Committee","license":[{"start":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T00:00:00Z","timestamp":1431907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NASA","award":["NNX12AQ39A"],"award-info":[{"award-number":["NNX12AQ39A"]}]},{"name":"NSF","award":["IIS-1029711","CCF-1451986","CNS-1314560","IIS-1422557","IIS-0953274","IIS-1447566"],"award-info":[{"award-number":["IIS-1029711","CCF-1451986","CNS-1314560","IIS-1422557","IIS-0953274","IIS-1447566"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,18]]},"DOI":"10.1145\/2736277.2741678","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T20:37:12Z","timestamp":1454704632000},"page":"205-215","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Collaborative Ranking with a Push at the Top"],"prefix":"10.1145","author":[{"given":"Konstantina","family":"Christakopoulou","sequence":"first","affiliation":[{"name":"Dept. of Computer Science & Engineering, University of Minnesota, Twin Cities, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arindam","family":"Banerjee","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science & Engineering, University of Minnesota, Twin Cities, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557029"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461256.2461277"},{"key":"e_1_3_2_1_3_1","volume-title":"SDM, 839--850","author":"Agarwal S.","year":"2011","unstructured":"S. Agarwal . The infinite push: A new support vector ranking algorithm that directly optimizes accuracy at the absolute top of the list . In SDM, 839--850 , 2011 . S. Agarwal. The infinite push: A new support vector ranking algorithm that directly optimizes accuracy at the absolute top of the list. In SDM, 839--850, 2011."},{"key":"e_1_3_2_1_4_1","volume-title":"ACM, (463)","author":"Baeza-Yates R.","year":"1999","unstructured":"R. Baeza-Yates and R-N. Berthier . Modern information retrieval . In ACM, (463) , 1999 . R. Baeza-Yates and R-N. Berthier. Modern information retrieval. In ACM, (463), 1999."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124314"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345465"},{"key":"e_1_3_2_1_7_1","volume-title":"NIPS, 953--961","author":"Boyd S.","year":"2012","unstructured":"S. Boyd , C. Cortes , M. Mohri , and A. Radovanovic . Accuracy at the top . In NIPS, 953--961 , 2012 . S. Boyd, C. Cortes, M. Mohri, and A. Radovanovic. Accuracy at the top. In NIPS, 953--961, 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_9_1","first-page":"23","article-title":"From RankNet to LambdaRank to LambdaMART: An overview","volume":"11","author":"Burges C.","year":"2010","unstructured":"C. JC Burges . From RankNet to LambdaRank to LambdaMART: An overview . In Learning , 11 : 23 -- 581 , 2010 . C. JC Burges. From RankNet to LambdaRank to LambdaMART: An overview. In Learning, 11:23--581, 2010.","journal-title":"Learning"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_11_1","volume-title":"Yahoo! Learning to Rank Challenge, 1--24","author":"Chapelle O.","year":"2011","unstructured":"O. Chapelle and Y. Chang . Yahoo! Learning to Rank Challenge Overview . In Yahoo! Learning to Rank Challenge, 1--24 , 2011 . O. Chapelle and Y. Chang. Yahoo! Learning to Rank Challenge Overview. In Yahoo! Learning to Rank Challenge, 1--24, 2011."},{"key":"e_1_3_2_1_12_1","first-page":"641","article-title":"Pranking with ranking","volume":"14","author":"Crammer K.","year":"2011","unstructured":"K. Crammer and Y. Singer . Pranking with ranking . In NIPS , 14 : 641 -- 647 , 2011 . K. Crammer and Y. Singer. Pranking with ranking. In NIPS, 14: 641--647, 2011.","journal-title":"NIPS"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"e_1_3_2_1_14_1","volume-title":"JMLR, (5): 1--55","author":"Ding N.","year":"2013","unstructured":"N. Ding , SVN Vishwanathan , M. Warmuth and V. S. Denchev . T-logistic regression for binary and multiclass classification . In JMLR, (5): 1--55 , 2013 . N. Ding, SVN Vishwanathan, M. Warmuth and V. S. Denchev. T-logistic regression for binary and multiclass classification. In JMLR, (5): 1--55, 2013."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390191"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2612"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2043956"},{"key":"e_1_3_2_1_21_1","volume-title":"Direct optimization of ranking measures. In arXiv preprint arXiv:0704.3359","author":"Le Q.","year":"2007","unstructured":"Q. Le , and A. Smola . Direct optimization of ranking measures. In arXiv preprint arXiv:0704.3359 , 2007 . Q. Le, and A. Smola. Direct optimization of ranking measures. In arXiv preprint arXiv:0704.3359, 2007."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2567970"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_25_1","volume-title":"NIPS, 1257--1264","author":"Mnih A.","year":"2007","unstructured":"A. Mnih and R. Salakhutdinov . Probabilistic matrix factorization . In NIPS, 1257--1264 , 2007 . A. Mnih and R. Salakhutdinov. Probabilistic matrix factorization. In NIPS, 1257--1264, 2007."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2670022"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"e_1_3_2_1_28_1","volume-title":"Sparse support vector infinite push. arXiv preprint arXiv:1206.6432","author":"Rakotomamonjy A.","year":"2012","unstructured":"A. Rakotomamonjy . Sparse support vector infinite push. arXiv preprint arXiv:1206.6432 , 2012 . A. Rakotomamonjy. Sparse support vector infinite push. arXiv preprint arXiv:1206.6432, 2012."},{"key":"e_1_3_2_1_29_1","volume-title":"UAI, 452--461","author":"Rendle S.","year":"2009","unstructured":"S. Rendle , C. Freudenthaler , Z. Gantner , and L. Schmidt-Thieme . BPR: Bayesian personalized ranking from implicit feedback . In UAI, 452--461 , 2009 . S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. BPR: Bayesian personalized ranking from implicit feedback. In UAI, 452--461, 2009."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755861"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390267"},{"key":"e_1_3_2_1_32_1","volume-title":"NIPS Workshop on Advances in Ranking, 1--6","author":"Sculley D.","year":"2009","unstructured":"D. Sculley . Large scale learning to rank . In NIPS Workshop on Advances in Ranking, 1--6 , 2009 . D. Sculley. Large scale learning to rank. In NIPS Workshop on Advances in Ranking, 1--6, 2009."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.116"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2365981"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505653"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507227"},{"key":"e_1_3_2_1_37_1","volume-title":"JMLR, 1453--1484","author":"Tsochantaridis I.","year":"2005","unstructured":"I. Tsochantaridis , T. Joachims , T. Hofmann , and Y. Altun . Large margin methods for structured and interdependent output variables . In JMLR, 1453--1484 , 2005 . I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. In JMLR, 1453--1484, 2005."},{"key":"e_1_3_2_1_38_1","volume-title":"NIPS, 2294--2302","author":"Volkovs M.","year":"2012","unstructured":"M. Volkovs and R. S. Zemel . Collaborative ranking with 17 parameters . In NIPS, 2294--2302 , 2012 . M. Volkovs and R. S. Zemel. Collaborative ranking with 17 parameters. In NIPS, 2294--2302, 2012."},{"key":"e_1_3_2_1_39_1","volume-title":"NIPS","author":"Weimer M.","year":"2007","unstructured":"M. Weimer , A. Karatzoglou , Q. V. Le , and A. Smola . CofiRank: Maximum margin matrix factorization for collaborative ranking . In NIPS , 2007 . M. Weimer, A. Karatzoglou, Q. V. Le, and A. Smola. CofiRank: Maximum margin matrix factorization for collaborative ranking. In NIPS, 2007."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_1_41_1","unstructured":"Yahoo! R1 dataset webscope.sandbox.yahoo.com  Yahoo! R1 dataset webscope.sandbox.yahoo.com"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645724"}],"event":{"name":"WWW '15: 24th International World Wide Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Florence Italy","acronym":"WWW '15"},"container-title":["Proceedings of the 24th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2736277.2741678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:30Z","timestamp":1750227150000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,18]]},"references-count":42,"alternative-id":["10.1145\/2736277.2741678","10.5555\/2736277"],"URL":"https:\/\/doi.org\/10.1145\/2736277.2741678","relation":{},"subject":[],"published":{"date-parts":[[2015,5,18]]},"assertion":[{"value":"2015-05-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}