{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:15:06Z","timestamp":1725992106480},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030010119"},{"type":"electronic","value":"9783030010126"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01012-6_16","type":"book-chapter","created":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T12:41:06Z","timestamp":1537274466000},"page":"198-210","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding High-Quality Unstructured Submissions in General Crowdsourcing Tasks"],"prefix":"10.1007","author":[{"given":"Shanshan","family":"Lyu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wentao","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huawei","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueqi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,19]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Baba, Y., Kashima, H.: Statistical quality estimation for general crowdsourcing tasks. In: KDD, pp. 554\u2013562. ACM (2013)","DOI":"10.1145\/2487575.2487600"},{"key":"16_CR2","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M., Nasrabadi, N.M.: Pattern Recognition and Machine Learning. Springer, New York (2006)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Burges, C., et al.: Learning to rank using gradient descent. In: ICML, pp. 89\u201396. ACM (2005)","DOI":"10.1145\/1102351.1102363"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: ICML, pp. 129\u2013136. ACM (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"16_CR5","first-page":"20","volume":"28","author":"AP Dawid","year":"1979","unstructured":"Dawid, A.P., Skene, A.M.: Maximum likelihood estimation of observer error-rates using the EM algorithm. J. R. Stat. Society. Ser. C (Appl. Stat.) 28, 20\u201328 (1979)","journal-title":"J. R. Stat. Society. Ser. C (Appl. Stat.)"},{"key":"16_CR6","unstructured":"Freund, Y., Iyer, R., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. J. Mach. Learn. Res. 4(Nov), 933\u2013969 (2003)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Kittur, A., Chi, E.H., Suh, B.: Crowdsourcing user studies with mechanical turk. In: CHI, pp. 453\u2013456. ACM (2008)","DOI":"10.1145\/1357054.1357127"},{"issue":"5","key":"16_CR8","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"key":"16_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14267-3","volume-title":"Learning to Rank for Information Retrieval","author":"Tie-Yan Liu","year":"2011","unstructured":"Liu, T.Y.: Learning to Rank for Information Retrieval. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-14267-3"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Ouyang, R.W., Kaplan, L., Martin, P., Toniolo, A., Srivastava, M., Norman, T.J.: Debiasing crowdsourced quantitative characteristics in local businesses and services. In: IPSN, pp. 190\u2013201. ACM (2015)","DOI":"10.1145\/2737095.2737116"},{"issue":"7","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1109\/TKDE.2016.2535383","volume":"28","author":"RW Ouyang","year":"2016","unstructured":"Ouyang, R.W., Kaplan, L.M., Toniolo, A., Srivastava, M., Norman, T.J.: Aggregating crowdsourced quantitative claims: additive and multiplicative models. IEEE Trans. Knowl. Data Eng. 28(7), 1621\u20131634 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1109\/TKDE.2015.2504928","volume":"28","author":"RW Ouyang","year":"2016","unstructured":"Ouyang, R.W., Srivastava, M., Toniolo, A., Norman, T.J.: Truth discovery in crowdsourced detection of spatial events. IEEE Trans. Knowl. Data Eng. 28(4), 1047\u20131060 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Quinn, A.J., Bederson, B.B.: Human computation: a survey and taxonomy of a growing field. In: CHI, pp. 1403\u20131412. ACM (2011)","DOI":"10.1145\/1978942.1979148"},{"key":"16_CR14","first-page":"1297","volume":"99","author":"VC Raykar","year":"2010","unstructured":"Raykar, V.C., Yu, S., Zhao, L.H., Valadez, G.H., Florin, C.: Learning from crowds. J. Mach. Learn. Res. 99, 1297\u20131322 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Sunahase, T., Baba, Y., Kashima, H.: Pairwise hits: quality estimation from pairwise comparisons in creator-evaluator crowdsourcing process. In: AAAI, pp. 977\u2013984 (2017)","DOI":"10.1609\/aaai.v31i1.10634"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Venanzi, M., Guiver, J., Kazai, G., Kohli, P., Shokouhi, M.: Community-based Bayesian aggregation models for crowdsourcing. In: WWW, pp. 155\u2013164. ACM (2014)","DOI":"10.1145\/2566486.2567989"},{"key":"16_CR17","unstructured":"Whitehill, J., Wu, T.F., Bergsma, J., Movellan, J.R., Ruvolo, P.L.: Whose vote should count more: optimal integration of labels from labelers of unknown expertise. In: NIPS, pp. 2035\u20132043 (2009)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Xu, J., Li, H.: Adarank: a boosting algorithm for information retrieval. In: SIGIR, pp. 391\u2013398. ACM (2007)","DOI":"10.1145\/1277741.1277809"},{"key":"16_CR19","unstructured":"Zaidan, O.F., Callison-Burch, C.: Crowdsourcing translation: professional quality from non-professionals. In: HLT, pp. 1220\u20131229. ACL (2011)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Zhuang, H., Parameswaran, A., Roth, D., Han, J.: Debiasing crowdsourced batches. In: KDD, pp. 1593\u20131602. ACM (2015)","DOI":"10.1145\/2783258.2783316"}],"container-title":["Lecture Notes in Computer Science","Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01012-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T17:20:21Z","timestamp":1662052821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01012-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030010119","9783030010126"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01012-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"CCIR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China Conference on Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guilin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ccir2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ccir2018.gxnu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}