Conference Paper/Proceeding/Abstract 767 views 63 downloads
Identifying and Rewarding Subcrowds in Crowdsourcing
22nd European Conference on Artificial Intelligence, Volume: 285: ECAI 2016, Pages: 1573 - 1574
Swansea University Author: Xiuyi Fan
-
PDF | Version of Record
Released under the terms of a Creative Commons Attribution Non-Commercial License 4.0 (CC-BY-NC).
Download (225.05KB)
DOI (Published version): 10.3233/978-1-61499-672-9-1573
Abstract
Identifying and rewarding truthful workers are key to the sustainability of crowdsourcing platforms. In this paper, we present a clustering based rewarding mechanism that rewards workers based on their truthfulness while accommodating the differences in workers' preferences. Experimental result...
Published in: | 22nd European Conference on Artificial Intelligence |
---|---|
ISBN: | 978-1-61499-671-2 978-1-61499-672-9 |
ISSN: | 0922-6389 1879-8314 |
Published: |
The Hague, The Netherlands
22nd European Conference on Artificial Intelligence
2016
|
Online Access: |
Check full text
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa39397 |
first_indexed |
2018-04-13T19:29:17Z |
---|---|
last_indexed |
2018-04-23T19:31:37Z |
id |
cronfa39397 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2018-04-23T14:05:19.5253498</datestamp><bib-version>v2</bib-version><id>39397</id><entry>2018-04-13</entry><title>Identifying and Rewarding Subcrowds in Crowdsourcing</title><swanseaauthors><author><sid>a88a07c43b3e80f27cb96897d1bc2534</sid><firstname>Xiuyi</firstname><surname>Fan</surname><name>Xiuyi Fan</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2018-04-13</date><deptcode>MACS</deptcode><abstract>Identifying and rewarding truthful workers are key to the sustainability of crowdsourcing platforms. In this paper, we present a clustering based rewarding mechanism that rewards workers based on their truthfulness while accommodating the differences in workers' preferences. Experimental results show that the proposed approach can effectively discover subcrowds under various conditions, and truthful workers are better rewarded than less truthful ones.</abstract><type>Conference Paper/Proceeding/Abstract</type><journal>22nd European Conference on Artificial Intelligence</journal><volume>285: ECAI 2016</volume><paginationStart>1573</paginationStart><paginationEnd>1574</paginationEnd><publisher>22nd European Conference on Artificial Intelligence</publisher><placeOfPublication>The Hague, The Netherlands</placeOfPublication><isbnPrint>978-1-61499-671-2</isbnPrint><isbnElectronic>978-1-61499-672-9</isbnElectronic><issnPrint>0922-6389</issnPrint><issnElectronic>1879-8314</issnElectronic><keywords/><publishedDay>29</publishedDay><publishedMonth>8</publishedMonth><publishedYear>2016</publishedYear><publishedDate>2016-08-29</publishedDate><doi>10.3233/978-1-61499-672-9-1573</doi><url>http://ebooks.iospress.nl/volumearticle/44926</url><notes/><college>COLLEGE NANME</college><department>Mathematics and Computer Science School</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>MACS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2018-04-23T14:05:19.5253498</lastEdited><Created>2018-04-13T15:19:54.7717106</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Siyuan</firstname><surname>Liu</surname><order>1</order></author><author><firstname>Xiuyi</firstname><surname>Fan</surname><order>2</order></author><author><firstname>Chunyan</firstname><surname>Miao</surname><order>3</order></author></authors><documents><document><filename>39397__16379__34bb8e1bccce4da9b90a3b2a4bd28c2e.pdf</filename><originalFilename>39397.pdf</originalFilename><uploaded>2020-01-21T18:16:09.5938123</uploaded><type>Output</type><contentLength>230454</contentLength><contentType>application/pdf</contentType><version>Version of Record</version><cronfaStatus>true</cronfaStatus><documentNotes>Released under the terms of a Creative Commons Attribution Non-Commercial License 4.0 (CC-BY-NC).</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language><licence>https://creativecommons.org/licenses/by-nc/4.0/</licence></document></documents><OutputDurs/></rfc1807> |
spelling |
2018-04-23T14:05:19.5253498 v2 39397 2018-04-13 Identifying and Rewarding Subcrowds in Crowdsourcing a88a07c43b3e80f27cb96897d1bc2534 Xiuyi Fan Xiuyi Fan true false 2018-04-13 MACS Identifying and rewarding truthful workers are key to the sustainability of crowdsourcing platforms. In this paper, we present a clustering based rewarding mechanism that rewards workers based on their truthfulness while accommodating the differences in workers' preferences. Experimental results show that the proposed approach can effectively discover subcrowds under various conditions, and truthful workers are better rewarded than less truthful ones. Conference Paper/Proceeding/Abstract 22nd European Conference on Artificial Intelligence 285: ECAI 2016 1573 1574 22nd European Conference on Artificial Intelligence The Hague, The Netherlands 978-1-61499-671-2 978-1-61499-672-9 0922-6389 1879-8314 29 8 2016 2016-08-29 10.3233/978-1-61499-672-9-1573 http://ebooks.iospress.nl/volumearticle/44926 COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University 2018-04-23T14:05:19.5253498 2018-04-13T15:19:54.7717106 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Siyuan Liu 1 Xiuyi Fan 2 Chunyan Miao 3 39397__16379__34bb8e1bccce4da9b90a3b2a4bd28c2e.pdf 39397.pdf 2020-01-21T18:16:09.5938123 Output 230454 application/pdf Version of Record true Released under the terms of a Creative Commons Attribution Non-Commercial License 4.0 (CC-BY-NC). true eng https://creativecommons.org/licenses/by-nc/4.0/ |
title |
Identifying and Rewarding Subcrowds in Crowdsourcing |
spellingShingle |
Identifying and Rewarding Subcrowds in Crowdsourcing Xiuyi Fan |
title_short |
Identifying and Rewarding Subcrowds in Crowdsourcing |
title_full |
Identifying and Rewarding Subcrowds in Crowdsourcing |
title_fullStr |
Identifying and Rewarding Subcrowds in Crowdsourcing |
title_full_unstemmed |
Identifying and Rewarding Subcrowds in Crowdsourcing |
title_sort |
Identifying and Rewarding Subcrowds in Crowdsourcing |
author_id_str_mv |
a88a07c43b3e80f27cb96897d1bc2534 |
author_id_fullname_str_mv |
a88a07c43b3e80f27cb96897d1bc2534_***_Xiuyi Fan |
author |
Xiuyi Fan |
author2 |
Siyuan Liu Xiuyi Fan Chunyan Miao |
format |
Conference Paper/Proceeding/Abstract |
container_title |
22nd European Conference on Artificial Intelligence |
container_volume |
285: ECAI 2016 |
container_start_page |
1573 |
publishDate |
2016 |
institution |
Swansea University |
isbn |
978-1-61499-671-2 978-1-61499-672-9 |
issn |
0922-6389 1879-8314 |
doi_str_mv |
10.3233/978-1-61499-672-9-1573 |
publisher |
22nd European Conference on Artificial Intelligence |
college_str |
Faculty of Science and Engineering |
hierarchytype |
|
hierarchy_top_id |
facultyofscienceandengineering |
hierarchy_top_title |
Faculty of Science and Engineering |
hierarchy_parent_id |
facultyofscienceandengineering |
hierarchy_parent_title |
Faculty of Science and Engineering |
department_str |
School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science |
url |
http://ebooks.iospress.nl/volumearticle/44926 |
document_store_str |
1 |
active_str |
0 |
description |
Identifying and rewarding truthful workers are key to the sustainability of crowdsourcing platforms. In this paper, we present a clustering based rewarding mechanism that rewards workers based on their truthfulness while accommodating the differences in workers' preferences. Experimental results show that the proposed approach can effectively discover subcrowds under various conditions, and truthful workers are better rewarded than less truthful ones. |
published_date |
2016-08-29T04:23:54Z |
_version_ |
1821287419111014400 |
score |
11.047306 |