{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:27:31Z","timestamp":1761395251649,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"973","award":["2015CB358700"],"award-info":[{"award-number":["2015CB358700"]}]},{"name":"NSF of China","award":["61632016,61472198,61521002,61661166012"],"award-info":[{"award-number":["61632016,61472198,61521002,61661166012"]}]},{"name":"TAL education"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183713.3183762","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"975-990","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["A Rating-Ranking Method for Crowdsourced Top-k Computation"],"prefix":"10.1145","author":[{"given":"Kaiyu","family":"Li","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(77)90073-4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/39.3-4.324"},{"key":"e_1_3_2_1_3_1","first-page":"1094","volume-title":"ICML","author":"Busa-Fekete R.","year":"2013","unstructured":"R. Busa-Fekete , B. Szorenyi , W. Cheng , P. Weng , and E. Hullermeier . Top-k selection based on adaptive sampling of noisy preferences . In ICML , pages 1094 -- 1102 , 2013 . R. Busa-Fekete, B. Szorenyi, W. Cheng, P. Weng, and E. Hullermeier. Top-k selection based on adaptive sampling of noisy preferences. In ICML, pages 1094--1102, 2013."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915252"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433420"},{"key":"e_1_3_2_1_6_1","first-page":"371","volume-title":"ICML","author":"Chen Y.","year":"2015","unstructured":"Y. Chen and C. Suh . Spectral MLE: top-k rank aggregation from pairwise comparisons . In ICML , pages 371 -- 380 , 2015 . Y. Chen and C. Suh. Spectral MLE: top-k rank aggregation from pairwise comparisons. In ICML, pages 371--380, 2015."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448524"},{"key":"e_1_3_2_1_8_1","first-page":"265","volume-title":"AISTATS","author":"Eriksson B.","year":"2013","unstructured":"B. Eriksson . Learning to top-k search using pairwise comparisons . In AISTATS , pages 265 -- 273 , 2013 . B. Eriksson. Learning to top-k search using pairwise comparisons. In AISTATS, pages 265--273, 2013."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750550"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2407353"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791195877"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05813-9_30"},{"key":"e_1_3_2_1_13_1","volume-title":"Practical methods of optimization","author":"Fletcher R.","year":"2013","unstructured":"R. Fletcher . Practical methods of optimization . John Wiley & Sons , 2013 . R. Fletcher. Practical methods of optimization. John Wiley & Sons, 2013."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989331"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553423"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213880"},{"key":"e_1_3_2_1_17_1","volume-title":"Hybrid strategies for finding the max with the crowd: Technical report. Technical report","author":"Khan A. R.","year":"2014","unstructured":"A. R. Khan and H. Garcia-Molina . Hybrid strategies for finding the max with the crowd: Technical report. Technical report , Stanford University , February 2014 . A. R. Khan and H. Garcia-Molina. Hybrid strategies for finding the max with the crowd: Technical report. Technical report, Stanford University, February 2014."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035953"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137833"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064036"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2535242"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3054776"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448944"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047487"},{"key":"e_1_3_2_1_25_1","first-page":"211","volume-title":"CIDR","author":"Marcus A.","year":"2011","unstructured":"A. Marcus , E. Wu , S. Madden , and R. C. Miller . Crowdsourced databases: Query processing with people . In CIDR , pages 211 -- 214 , 2011 . A. Marcus, E. Wu, S. Madden, and R. C. Miller. Crowdsourced databases: Query processing with people. In CIDR, pages 211--214, 2011."},{"key":"e_1_3_2_1_26_1","volume-title":"CRC Press","author":"Marden J. I.","year":"1996","unstructured":"J. I. Marden . Analyzing and modeling rank data . CRC Press , 1996 . J. I. Marden. Analyzing and modeling rank data. CRC Press, 1996."},{"key":"e_1_3_2_1_27_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_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213878"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367555"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610503"},{"key":"e_1_3_2_1_31_1","volume-title":"AAAI","author":"Pfeiffer T.","year":"2012","unstructured":"T. Pfeiffer , X. A. Gao , Y. Chen , A. Mao , and D. G. Rand . Adaptive polling for information aggregation . In AAAI , 2012 . T. Pfeiffer, X. A. Gao, Y. Chen, A. Mao, and D. G. Rand. Adaptive polling for information aggregation. In AAAI, 2012."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2464701"},{"key":"e_1_3_2_1_33_1","first-page":"964","volume-title":"ICDE","author":"Sarma A. D.","year":"2014","unstructured":"A. D. Sarma , A. G. Parameswaran , H. Garcia-Molina , and A. Y. Halevy . Crowd-powered find algorithms . In ICDE , pages 964 -- 975 , 2014 . A. D. Sarma, A. G. Parameswaran, H. Garcia-Molina, and A. Y. Halevy. Crowd-powered find algorithms. In ICDE, pages 964--975, 2014."},{"key":"e_1_3_2_1_34_1","volume-title":"T-crowd: Effective crowdsourcing for tabular data. ICDE, abs\/1708.02125","author":"Shan C.","year":"2018","unstructured":"C. Shan , N. Mamoulis , G. Li , R. Cheng , Z. Huang , and Y. Zheng . T-crowd: Effective crowdsourcing for tabular data. ICDE, abs\/1708.02125 , 2018 . C. Shan, N. Mamoulis, G. Li, R. Cheng, Z. Huang, and Y. Zheng. T-crowd: Effective crowdsourcing for tabular data. ICDE, abs\/1708.02125, 2018."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1037\/h0065439"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544865"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187969"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350263"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465280"},{"key":"e_1_3_2_1_40_1","first-page":"109","volume-title":"ICML","author":"Wauthier F. L.","year":"2013","unstructured":"F. L. Wauthier , M. I. Jordan , and N. Jojic . Efficient ranking from pairwise comparisons . In ICML , pages 109 -- 117 , 2013 . F. L. Wauthier, M. I. Jordan, and N. Jojic. Efficient ranking from pairwise comparisons. In ICML, pages 109--117, 2013."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132891"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1814433.1814443"},{"key":"e_1_3_2_1_43_1","volume-title":"ICML '13 Workshop","author":"Ye P.","year":"2013","unstructured":"P. Ye , U. EDU, and D. Doermann . Combining preference and absolute judgements in a crowd-sourced setting . In ICML '13 Workshop , 2013 . P. Ye, U. EDU, and D. Doermann. Combining preference and absolute judgements in a crowd-sourced setting. In ICML '13 Workshop, 2013."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2921558.2921559"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025118"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055547"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749430"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132912"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Houston TX USA","acronym":"SIGMOD\/PODS '18"},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3183762","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3183762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:17Z","timestamp":1750210757000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3183762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":48,"alternative-id":["10.1145\/3183713.3183762","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3183762","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}