...
首页> 外文期刊>IEEE Transactions on Systems, Man, and Cybernetics >Context-Aware Reliable Crowdsourcing in Social Networks
【24h】

Context-Aware Reliable Crowdsourcing in Social Networks

机译:社交网络中情境感知的可靠众包

获取原文
获取原文并翻译 | 示例

摘要

There are two problems in the traditional crowdsourcing systems for handling complex tasks. First, decomposing complex tasks into a set of micro-subtasks requires the decomposition capability of the requesters; thus, some requesters may abandon using crowdsourcing to accomplish a large number of complex tasks since they cannot bear such heavy burden by themselves. Second, tasks are often assigned redundantly to multiple workers to achieve reliable results, but reliability may not be ensured when there are many malicious workers in the crowd. Currently, it is observed that the workers are often connected through social networks, a feature that can significantly facilitate task allocation and task execution in crowdsourcing. Therefore, this paper investigates crowdsourcing in social networks and presents a novel context-aware reliable crowdsourcing approach. In our presented approach, the two problems in traditional crowdsourcing are addressed as follows: 1) the complex tasks can be performed through autonomous coordination between the assigned worker and his contextual workers in the social network; thus, the requesters can be exempt from a heavy computing load for decomposing complex tasks into subtasks and combing the partial results of subtasks, thereby enabling more requesters to accomplish a large number of complex tasks through crowdsourcing, and 2) the reliability of a worker is determined not only by the reputation of the worker himself but also by the reputations of the contextual workers in the social network; thus, the unreliability of transient or malicious workers can be effectively addressed. The presented approach addresses two types of social networks including simplex and multiplex networks. Based on theoretical analyses and experiments on a real-world dataset, we find that the presented approach can achieve significantly higher task allocation and execution efficiency than the previous benchmark task allocation approaches; moreover, the presented contextual reputation mechanism can achieve relatively higher reliability when there are many malicious workers in the crowd.
机译:传统的众包系统在处理复杂任务时存在两个问题。首先,将复杂的任务分解为一组微型子任务需要请求者的分解能力。因此,一些请求者可能会放弃使用众包来完成大量复杂的任务,因为他们自己无法承受如此沉重的负担。其次,任务通常被冗余地分配给多个工作人员以获得可靠的结果,但是当人群中有许多恶意工作人员时,可能无法确保可靠性。当前,观察到工人经常通过社交网络连接,该功能可以显着促进众包中的任务分配和任务执行。因此,本文对社交网络中的众包进行了调查,并提出了一种新颖的上下文感知的可靠众包方法。在我们提出的方法中,解决了传统众包中的两个问题:1)复杂的任务可以通过在社交网络中被分配的工人与其上下文工人之间的自主协调来执行;因此,请求者可以免于繁重的计算工作,因为它可以将复杂的任务分解为子任务并组合子任务的部分结果,从而使更多的请求者可以通过众包来完成大量复杂的任务,并且2)工人的可靠性是不仅由工作人员本人的声誉决定,而且还由上下文工作者在社交网络中的声誉确定;因此,可以有效地解决临时或恶意工作人员的不可靠性。提出的方法解决了两种类型的社交网络,包括单工和多工网络。基于对真实数据集的理论分析和实验,我们发现,与以前的基准任务分配方法相比,该方法可以实现更高的任务分配和执行效率。此外,当人群中有很多恶意工作者时,所提出的上下文信誉机制可以实现相对较高的可靠性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号