Fair Team Recommendations for Multidisciplinary Projects

Lucas Machado, K. Stefanidis
{"title":"Fair Team Recommendations for Multidisciplinary Projects","authors":"Lucas Machado, K. Stefanidis","doi":"10.1145/3350546.3352533","DOIUrl":null,"url":null,"abstract":"The focus of this work is on the problem of team recommendations, in which teams have multidisciplinary requirements and team members’ selection is based on the match of their skills and the requirements. When assembling multiple teams there is also a challenge of allocating the best members in a fair way between the teams. We formally define the problem and propose a brute force and a faster heuristic method as solutions to create team recommendations to multidisciplinary projects. Furthermore, to increase the fairness between the recommended teams, the K-rounds and Pairs-rounds methods are proposed as variations of the heuristic approach. Several different test scenarios are executed to analyze and compare the effectiveness of these methods.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3350546.3352533","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

The focus of this work is on the problem of team recommendations, in which teams have multidisciplinary requirements and team members’ selection is based on the match of their skills and the requirements. When assembling multiple teams there is also a challenge of allocating the best members in a fair way between the teams. We formally define the problem and propose a brute force and a faster heuristic method as solutions to create team recommendations to multidisciplinary projects. Furthermore, to increase the fairness between the recommended teams, the K-rounds and Pairs-rounds methods are proposed as variations of the heuristic approach. Several different test scenarios are executed to analyze and compare the effectiveness of these methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多学科项目的公平团队建议
这项工作的重点是团队推荐的问题,其中团队有多学科的需求,团队成员的选择是基于他们的技能和需求的匹配。当组建多个团队时,在团队之间公平分配最佳成员也是一个挑战。我们正式定义了这个问题,并提出了一种蛮力和一种更快的启发式方法作为解决方案,为多学科项目创建团队建议。此外,为了提高推荐团队之间的公平性,提出了k轮法和成对轮法作为启发式方法的变体。执行几个不同的测试场景来分析和比较这些方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards Issue Recommendation for Open Source Communities Exploring Differences in the Impact of Users’ Traces on Arabic and English Facebook Search Design and implementation of an open source Greek POS Tagger and Entity Recognizer using spaCy Extracting Ego-Centric Social Networks from Linked Open Data Towards an End-User Layer for Data Integrity
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1