Competition-aware task routing for contest based crowdsourced software development

Yang Fu, Hailong Sun, Luting Ye
{"title":"Competition-aware task routing for contest based crowdsourced software development","authors":"Yang Fu, Hailong Sun, Luting Ye","doi":"10.1109/SOFTWAREMINING.2017.8100851","DOIUrl":null,"url":null,"abstract":"In crowdsourced software development, routing a task to right developers is a critical issue that largely affects the productivity and quality of software. In particular, crowdsourced software development platforms (e.g. Topcoder and Kaggle) usually adopt the competition-based crowdsourcing model. Given an incoming task, most of existing efforts focus on using the historical data to learn the probability that a developer may take the task and recommending developers accordingly. However, existing work ignores the locality characteristics of the developer-task dataset and the competition among developers. In this work, we propose a novel recommendation approach for task routing in competitive crowdsourced software development. First, we cluster tasks on the basis of content similarity. Second, for a given task, with the most similar task cluster, we utilize machine learning based classification to recommend a list of candidate developers. Third, we consider the competitive relationship among developers and re-rank the candidates by incorporating the competition network among them. Experiments conducted on 3 datasets (totally 7,481 tasks) crawled from Topcoder show that our approach delivers promising recommendation accuracy and outperforms the two comparing methods by 5.5% and 25.4% on average respectively.","PeriodicalId":377808,"journal":{"name":"2017 6th International Workshop on Software Mining (SoftwareMining)","volume":"14 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th International Workshop on Software Mining (SoftwareMining)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOFTWAREMINING.2017.8100851","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

In crowdsourced software development, routing a task to right developers is a critical issue that largely affects the productivity and quality of software. In particular, crowdsourced software development platforms (e.g. Topcoder and Kaggle) usually adopt the competition-based crowdsourcing model. Given an incoming task, most of existing efforts focus on using the historical data to learn the probability that a developer may take the task and recommending developers accordingly. However, existing work ignores the locality characteristics of the developer-task dataset and the competition among developers. In this work, we propose a novel recommendation approach for task routing in competitive crowdsourced software development. First, we cluster tasks on the basis of content similarity. Second, for a given task, with the most similar task cluster, we utilize machine learning based classification to recommend a list of candidate developers. Third, we consider the competitive relationship among developers and re-rank the candidates by incorporating the competition network among them. Experiments conducted on 3 datasets (totally 7,481 tasks) crawled from Topcoder show that our approach delivers promising recommendation accuracy and outperforms the two comparing methods by 5.5% and 25.4% on average respectively.
基于竞赛的众包软件开发的竞赛意识任务路由
在众包软件开发中,将任务分配给合适的开发人员是一个关键问题,它在很大程度上影响了软件的生产力和质量。特别是众包软件开发平台(如Topcoder和Kaggle)通常采用基于竞争的众包模式。给定一个即将到来的任务,大多数现有的工作都集中在使用历史数据来了解开发人员接受该任务的可能性,并相应地推荐开发人员。然而,现有的工作忽略了开发人员任务数据集的局部性特征和开发人员之间的竞争。在这项工作中,我们提出了一种新的推荐方法,用于竞争性众包软件开发中的任务路由。首先,我们基于内容相似度对任务进行聚类。其次,对于给定的任务,使用最相似的任务集群,我们利用基于机器学习的分类来推荐候选开发人员列表。第三,我们考虑了开发商之间的竞争关系,并通过整合他们之间的竞争网络来重新排名候选人。在从Topcoder抓取的3个数据集(共7,481个任务)上进行的实验表明,我们的方法提供了很好的推荐准确率,并且平均比两种比较方法分别高出5.5%和25.4%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信