{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:28Z","timestamp":1763468248954,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,31]],"date-time":"2015-05-31T00:00:00Z","timestamp":1433030400000},"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":[[2015,5,31]]},"DOI":"10.1145\/2767109.2767110","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"41-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Analyzing Crowd Rankings"],"prefix":"10.1145","author":[{"given":"Julia","family":"Stoyanovich","sequence":"first","affiliation":[{"name":"Drexel University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie","family":"Jacob","sequence":"additional","affiliation":[{"name":"University of Pennsylvania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemei","family":"Gong","sequence":"additional","affiliation":[{"name":"Drexel University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Amazon Mechanical Turk. https:\/\/www.mturk.com. Amazon Mechanical Turk. https:\/\/www.mturk.com."},{"key":"e_1_3_2_1_2_1","unstructured":"CrowdFlower. http:\/\/crowdflower.com\/. CrowdFlower. http:\/\/crowdflower.com\/."},{"key":"e_1_3_2_1_3_1","volume-title":"VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules in large databases . In VLDB , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, 1994."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807341"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303983"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187971"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433420"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.04.007"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448524"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213905"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347251"},{"issue":"3","key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1111\/j.2517-6161.1986.tb01420.x","article-title":"Distance-based ranking models","volume":"48","author":"Fligner M. A.","year":"1986","unstructured":"M. A. Fligner and J. S. Verducci . Distance-based ranking models . Journal of the Royal Statistical Society. Series B , 48 ( 3 ): 359 -- 369 , 1986 . M. A. Fligner and J. S. Verducci. Distance-based ranking models. Journal of the Royal Statistical Society. Series B, 48(3):359--369, 1986.","journal-title":"Journal of the Royal Statistical Society. Series B"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989331"},{"key":"e_1_3_2_1_14_1","volume-title":"ICML","author":"Gormley I. C.","year":"2006","unstructured":"I. C. Gormley and T. B. Murphy . A latent space model for rank data . In ICML , 2006 . I. C. Gormley and T. B. Murphy. A latent space model for rank data. In ICML, 2006."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213880"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963314"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732998"},{"issue":"1","key":"e_1_3_2_1_18_1","first-page":"1","article-title":"A survey of frequent subgraph mining algorithms","volume":"1","author":"Jiang C.","year":"2013","unstructured":"C. Jiang , F. Coenen , and M. Zito . A survey of frequent subgraph mining algorithms . The Knowledge Engineering Review , 1 ( 1 ): 1 -- 31 , 2013 . C. Jiang, F. Coenen, and M. Zito. A survey of frequent subgraph mining algorithms. The Knowledge Engineering Review, 1(1):1--31, 2013.","journal-title":"The Knowledge Engineering Review"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-007-9050-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047487"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294299"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213878"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213951"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401965"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951417"},{"key":"e_1_3_2_1_26_1","volume-title":"CIDR","author":"Stoyanovich J.","year":"2013","unstructured":"J. Stoyanovich Understanding local structure in ranked datasets . In CIDR , 2013 . J. Stoyanovich et al. Understanding local structure in ranked datasets. In CIDR, 2013."},{"key":"e_1_3_2_1_27_1","volume-title":"ICIS","author":"Wang J.","year":"2012","unstructured":"J. Wang , A. Ghose , and P. Ipeirotis . Bonus, disclosure, and choice: What motivates the creation of high-quality paid reviews ? In ICIS , 2012 . J. Wang, A. Ghose, and P. Ipeirotis. Bonus, disclosure, and choice: What motivates the creation of high-quality paid reviews? In ICIS, 2012."},{"key":"e_1_3_2_1_28_1","volume-title":"NIPS","author":"Welinder P.","year":"2010","unstructured":"P. Welinder The multidimensional wisdom of crowds . In NIPS , 2010 . P. Welinder et al. The multidimensional wisdom of crowds. In NIPS, 2010."},{"key":"e_1_3_2_1_29_1","volume-title":"NIPS","author":"Whitehill J.","year":"2009","unstructured":"J. Whitehill Whose vote should count more: Optimal integration of labels from labelers of unknown expertise . In NIPS , 2009 . J. Whitehill et al. Whose vote should count more: Optimal integration of labels from labelers of unknown expertise. In NIPS, 2009."}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Melbourne VIC Australia","acronym":"SIGMOD\/PODS'15"},"container-title":["Proceedings of the 18th International Workshop on Web and Databases"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767109.2767110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2767109.2767110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:02Z","timestamp":1750225382000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767109.2767110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,31]]},"references-count":29,"alternative-id":["10.1145\/2767109.2767110","10.1145\/2767109"],"URL":"https:\/\/doi.org\/10.1145\/2767109.2767110","relation":{},"subject":[],"published":{"date-parts":[[2015,5,31]]},"assertion":[{"value":"2015-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}