{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:04:39Z","timestamp":1767650679904,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,8,24]],"date-time":"2014-08-24T00:00:00Z","timestamp":1408838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,8,24]]},"DOI":"10.1145\/2623330.2623730","type":"proceedings-article","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T19:38:46Z","timestamp":1408736326000},"page":"502-511","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Active collaborative permutation learning"],"prefix":"10.1145","author":[{"given":"Jialei","family":"Wang","sequence":"first","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathan","family":"Srebro","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute at Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Evans","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"137","article-title":"An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity","volume":"13","author":"Ailon N.","year":"2012","unstructured":"N. Ailon . An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity . Journal of Machine Learning Research , 13 : 137 -- 164 , 2012 . N. Ailon. An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity. Journal of Machine Learning Research, 13:137--164, 2012.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_2_1","first-page":"19","article-title":"Active learning using smooth relative regret approximations with applications","volume":"23","author":"Ailon N.","year":"2012","unstructured":"N. Ailon , R. Begleiter , and E. Ezra . Active learning using smooth relative regret approximations with applications . COLT , 23 : 19 .1--19.20, 2012 . N. Ailon, R. Begleiter, and E. Ezra. Active learning using smooth relative regret approximations with applications. COLT, 23:19.1--19.20, 2012.","journal-title":"COLT"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124314"},{"key":"e_1_3_2_2_4_1","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"Bartlett P. L.","year":"2002","unstructured":"P. L. Bartlett and S. Mendelson . Rademacher and Gaussian complexities: Risk bounds and structural results . Journal of Machine Learning Research , 3 : 463 -- 482 , 2002 . P. L. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3:463--482, 2002.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_5_1","first-page":"98","volume-title":"UAI","author":"Boutilier C.","year":"2003","unstructured":"C. Boutilier , R. S. Zemel , and B. M. Marlin . Active collaborative filtering . In UAI , pages 98 -- 106 , 2003 . C. Boutilier, R. S. Zemel, and B. M. Marlin. Active collaborative filtering. In UAI, pages 98--106, 2003."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"e_1_3_2_2_7_1","unstructured":"J. C. de Borda. M\u00e9moire sur les \u00e9lections au scrutin. Histoire de l'Acad\u00e9mie Royale des Sciences 1784.  J. C. de Borda. M\u00e9moire sur les \u00e9lections au scrutin. Histoire de l'Acad\u00e9mie Royale des Sciences 1784."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755882"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2001.945730"},{"key":"e_1_3_2_2_10_1","first-page":"315","volume-title":"COLT","author":"Foygel R.","year":"2011","unstructured":"R. Foygel and N. Srebro . Concentration-based guarantees for low-rank matrix reconstruction . In COLT , pages 315 -- 340 , 2011 . R. Foygel and N. Srebro. Concentration-based guarantees for low-rank matrix reconstruction. In COLT, pages 315--340, 2011."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963774"},{"key":"e_1_3_2_2_12_1","first-page":"2240","volume-title":"NIPS","author":"Jamieson K. G.","year":"2011","unstructured":"K. G. Jamieson and R. D. Nowak . Active ranking using pairwise comparisons . In NIPS , pages 2240 -- 2248 , 2011 . K. G. Jamieson and R. D. Nowak. Active ranking using pairwise comparisons. In NIPS, pages 2240--2248, 2011."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0419-x"},{"key":"e_1_3_2_2_14_1","first-page":"278","volume-title":"UAI","author":"Jin R.","year":"2004","unstructured":"R. Jin and L. Si . A bayesian approach toward active learning for collaborative filtering . In UAI , pages 278 -- 285 , 2004 . R. Jin and L. Si. A bayesian approach toward active learning for collaborative filtering. In UAI, pages 278--285, 2004."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956823"},{"key":"e_1_3_2_2_16_1","first-page":"1297","volume-title":"NIPS","author":"Lee J. D.","year":"2010","unstructured":"J. D. Lee , B. Recht , R. Salakhutdinov , N. Srebro , and J. A. Tropp . Practical large-scale optimization for max-norm regularization . In NIPS , pages 1297 -- 1305 , 2010 . J. D. Lee, B. Recht, R. Salakhutdinov, N. Srebro, and J. A. Tropp. Practical large-scale optimization for max-norm regularization. In NIPS, pages 1297--1305, 2010."},{"key":"e_1_3_2_2_17_1","first-page":"2483","volume-title":"NIPS","author":"Negahban S.","year":"2012","unstructured":"S. Negahban , S. Oh , and D. Shah . Iterative ranking from pair-wise comparisons . In NIPS , pages 2483 -- 2491 , 2012 . S. Negahban, S. Oh, and D. Shah. Iterative ranking from pair-wise comparisons. In NIPS, pages 2483--2491, 2012."},{"key":"e_1_3_2_2_18_1","volume-title":"A method for solving a convex programming problem with convergence rate o( 1 over k2)","author":"Nesterov Y.","year":"1983","unstructured":"Y. Nesterov . A method for solving a convex programming problem with convergence rate o( 1 over k2) . 1983 . Y. Nesterov. A method for solving a convex programming problem with convergence rate o( 1 over k2). 1983."},{"key":"e_1_3_2_2_19_1","volume-title":"Prisma: Proximal iterative smoothing algorithm. CoRR, abs\/1206.2372","author":"Orabona F.","year":"2012","unstructured":"F. Orabona , A. Argyriou , and N. Srebro . Prisma: Proximal iterative smoothing algorithm. CoRR, abs\/1206.2372 , 2012 . F. Orabona, A. Argyriou, and N. Srebro. Prisma: Proximal iterative smoothing algorithm. CoRR, abs\/1206.2372, 2012."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/090763184"},{"key":"e_1_3_2_2_21_1","volume-title":"ICML","author":"Rajkumar A.","year":"2014","unstructured":"A. Rajkumar and S. Agarwal . A statistical convergence perspective of algorithms for rank aggregation from pairwise data . In ICML , 2014 . A. Rajkumar and S. Agarwal. A statistical convergence perspective of algorithms for rank aggregation from pairwise data. In ICML, 2014."},{"key":"e_1_3_2_2_22_1","volume-title":"ISAIM","author":"Rish I.","year":"2008","unstructured":"I. Rish and G. Tesauro . Active collaborative prediction with maximum margin matrix factorization . In ISAIM , 2008 . I. Rish and G. Tesauro. Active collaborative prediction with maximum margin matrix factorization. In ISAIM, 2008."},{"key":"e_1_3_2_2_23_1","volume-title":"NIPS","author":"Salakhutdinov R.","year":"2007","unstructured":"R. Salakhutdinov and A. Mnih . Probabilistic matrix factorization . In NIPS , 2007 . R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In NIPS, 2007."},{"key":"e_1_3_2_2_24_1","volume-title":"The collaborative image of the city: Mapping the inequality of urban perception. 8(7):e68400","author":"Salesses P.","year":"2013","unstructured":"P. Salesses , K. Schechtner , and C. A. Hidalgo . The collaborative image of the city: Mapping the inequality of urban perception. 8(7):e68400 , 2013 . P. Salesses, K. Schechtner, and C. A. Hidalgo. The collaborative image of the city: Mapping the inequality of urban perception. 8(7):e68400, 2013."},{"key":"e_1_3_2_2_25_1","volume-title":"Wiki surveys: Open and quantifiable social data collection. arXiv:1202.0500","author":"Salganik M. J.","year":"2012","unstructured":"M. J. Salganik and K. E. C. Levy . Wiki surveys: Open and quantifiable social data collection. arXiv:1202.0500 , 2012 . M. J. Salganik and K. E. C. Levy. Wiki surveys: Open and quantifiable social data collection. arXiv:1202.0500, 2012."},{"key":"e_1_3_2_2_26_1","volume-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","author":"Settles B.","year":"2012","unstructured":"B. Settles . Active Learning . Synthesis Lectures on Artificial Intelligence and Machine Learning . Morgan & Claypool Publishers , 2012 . B. Settles. Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, 2012."},{"key":"e_1_3_2_2_27_1","volume-title":"NIPS","author":"Srebro N.","year":"2004","unstructured":"N. Srebro , J. D. M. Rennie , and T. Jaakkola . Maximum-margin matrix factorization . In NIPS , 2004 . N. Srebro, J. D. M. Rennie, and T. Jaakkola. Maximum-margin matrix factorization. In NIPS, 2004."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_37"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244302760185243"},{"key":"e_1_3_2_2_30_1","first-page":"2303","volume-title":"NIPS","author":"Volkovs M.","year":"2012","unstructured":"M. Volkovs and R. S. Zemel . Collaborative ranking with 17 parameters . In NIPS , pages 2303 -- 2311 , 2012 . M. Volkovs and R. S. Zemel. Collaborative ranking with 17 parameters. In NIPS, pages 2303--2311, 2012."},{"key":"e_1_3_2_2_31_1","first-page":"109","volume-title":"ICML (3)","author":"Wauthier F. L.","year":"2013","unstructured":"F. L. Wauthier , M. I. Jordan , and N. Jojic . Efficient ranking from pairwise comparisons . In ICML (3) , pages 109 -- 117 , 2013 . F. L. Wauthier, M. I. Jordan, and N. Jojic. Efficient ranking from pairwise comparisons. In ICML (3), pages 109--117, 2013."},{"key":"e_1_3_2_2_32_1","volume-title":"NIPS","author":"Weimer M.","year":"2007","unstructured":"M. Weimer , A. Karatzoglou , Q. V. Le , and A. J. Smola . Cofi rank - maximum margin matrix factorization for collaborative ranking . In NIPS , 2007 . M. Weimer, A. Karatzoglou, Q. V. Le, and A. J. Smola. Cofi rank - maximum margin matrix factorization for collaborative ranking. In NIPS, 2007."}],"event":{"name":"KDD '14: The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"New York New York USA","acronym":"KDD '14"},"container-title":["Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2623330.2623730","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2623330.2623730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:41Z","timestamp":1750231181000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2623330.2623730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,24]]},"references-count":32,"alternative-id":["10.1145\/2623330.2623730","10.1145\/2623330"],"URL":"https:\/\/doi.org\/10.1145\/2623330.2623730","relation":{},"subject":[],"published":{"date-parts":[[2014,8,24]]},"assertion":[{"value":"2014-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}