{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:55Z","timestamp":1750307095198,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T00:00:00Z","timestamp":1351468800000},"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":[[2012,10,29]]},"DOI":"10.1145\/2396761.2398681","type":"proceedings-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T16:38:00Z","timestamp":1352997480000},"page":"2519-2522","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A new probabilistic model for top-k ranking problem"],"prefix":"10.1145","author":[{"given":"Shuzi","family":"Niu","sequence":"first","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Yanyan","family":"Lan","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Jiafeng","family":"Guo","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Xueqi","family":"Cheng","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2012,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2671","volume":"8","author":"Cl\u00e9men\u00e7on S.","year":"2007","unstructured":"S. Cl\u00e9men\u00e7on and N. Vayatis . Ranking the best instances. JMLR , 8 : 2671 -- 2699 , 2007 . S. Cl\u00e9men\u00e7on and N. Vayatis. Ranking the best instances. JMLR, 8:2671--2699, 2007.","journal-title":"Ranking the best instances. JMLR"},{"key":"e_1_3_2_1_2_1","volume-title":"NIPS'09","author":"Huang J.","year":"2009","unstructured":"J. Huang and C. Guestrin . Riffled independence for ranked data . NIPS'09 , 2009 . J. Huang and C. Guestrin. Riffled independence for ranked data. NIPS'09, 2009."},{"key":"e_1_3_2_1_3_1","volume-title":"JMLR'10","author":"Huang J.","year":"2010","unstructured":"J. Huang and C. Guestrin . Learning hierarchical riffle independent groupings from rankings . JMLR'10 , 2010 . J. Huang and C. Guestrin. Learning hierarchical riffle independent groupings from rankings. JMLR'10, 2010."},{"unstructured":"J. Huang A. Kapoor and C. Guestrin. Efficient probabilistic inference with partial ranking queries. UAI2011.  J. Huang A. Kapoor and C. Guestrin. Efficient probabilistic inference with partial ranking queries. UAI2011.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","first-page":"363","volume-title":"ICML'02","author":"Lebanon G.","year":"2002","unstructured":"G. Lebanon and J. D. Lafferty . Cranking: Combining rankings using conditional probability models on permutations . ICML'02 , pages 363 -- 370 , 2002 . G. Lebanon and J. D. Lafferty. Cranking: Combining rankings using conditional probability models on permutations. ICML'02, pages 363--370, 2002."},{"key":"e_1_3_2_1_6_1","volume-title":"Analyzing and Modeling Rank Data","author":"Marden J. I.","year":"1995","unstructured":"J. I. Marden . Analyzing and Modeling Rank Data . Chapman & Hall , 1995 . J. I. Marden. Analyzing and Modeling Rank Data. Chapman & Hall, 1995."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/2348283.2348384"},{"key":"e_1_3_2_1_8_1","first-page":"1948","volume-title":"NIPS'10","author":"Qin T.","year":"2010","unstructured":"T. Qin , X. Geng , and T.-Y. Liu . A new probabilistic model for rank aggregation . NIPS'10 , pages 1948 -- 1956 . 2010 . T. Qin, X. Geng, and T.-Y. Liu. A new probabilistic model for rank aggregation. NIPS'10, pages 1948--1956. 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/11776420_43"},{"key":"e_1_3_2_1_10_1","first-page":"2098","volume-title":"NIPS'09","author":"Xia F.","year":"2009","unstructured":"F. Xia , T.-Y. Liu , and H. Li . Statistical consistency of top-k ranking . NIPS'09 , pages 2098 -- 2106 . 2009 . F. Xia, T.-Y. Liu, and H. Li. Statistical consistency of top-k ranking. NIPS'09, pages 2098--2106. 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1390156.1390306"}],"event":{"sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"CIKM'12","name":"CIKM'12: 21st ACM International Conference on Information and Knowledge Management","location":"Maui Hawaii USA"},"container-title":["Proceedings of the 21st ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2398681","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2396761.2398681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:42Z","timestamp":1750239282000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2398681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,29]]},"references-count":11,"alternative-id":["10.1145\/2396761.2398681","10.1145\/2396761"],"URL":"https:\/\/doi.org\/10.1145\/2396761.2398681","relation":{},"subject":[],"published":{"date-parts":[[2012,10,29]]},"assertion":[{"value":"2012-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}