arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.11191cs.SI
收藏

现实网络中基于社区的多团队组建

Multi-team Formation using Community Based Approach in Real-World Networks

Ramesh Bobby Addanki, Durga Bhavani S

摘要:

在一个组织中,需要多种技能的任务称为项目,通常分配给团队而不是个人。团队组建问题是指在给定的任务下,如何以最小的通信代价选择合适的团队来完成任务的问题。我们提出了一种算法,利用社会网络的社区结构,并形成一个团队,通过选择一个领导者与它的邻居从一个社区。该算法与文献中以技能为中心的算法不同,该算法从搜索每个技能开始,合适的专家,并且不显式地考虑底层社交网络的结构。基于社区的团队形成策略称为TFC,它是一种可扩展的方法,可以在合理的时间内通过非常大的网络获得团队。此外,对于一个任务,我们的算法TFC-R和TFC-N从社区中生成多个团队,这在本文中作为案例研究进行了展示。实验是在著名的DBLP数据集上进行的,其中任务被认为是写一篇研究论文,标题的单词被认为是技能。团队形成问题被转化为寻找可能的作者为给定的文件,谁拥有所需的技能,并具有最少的沟通成本。在这个过程中,我们从DBLP中构建了一个更大的基准数据集,用于团队组建实验。尽管基准算法Rarestfirst花费的时间最少,但我们的算法TFC-N和TFC-R给出了更好的通信代价。它们在寻找团队所需的时间方面也优于MinLD和MinSD等标准算法。我们的算法在社区上所花费的时间比在更大的网络上所花费的时间快几个数量级,而不会对通信成本造成太大的影响。

英文摘要:

In an organization, tasks called projects that require several skills, are generally assigned to teams rather than individuals. The problem of choosing a right team for a given task with minimal communication cost is known as team formation problem and many algorithms have been proposed in the literature. We propose an algorithm that exploits the community structure of the social network and forms a team by choosing a leader along with its neighbours from within a community. This algorithm is different from the skill-centric algorithms in the literature which start by searching for each skill, the suitable experts and do not explicitly consider the structure of the underlying social network. The strategy of community-based team formation called TFC leads to a scalable approach that obtains teams within reasonable time over very large networks. Further, for one task our algorithms TFC-R and TFC-N generate multiple teams from the communities which is show-cased as a case-study in the paper. The experimentation is carried out on the well-known DBLP data set where the task is considered as writing a research paper and the words of the title are considered as skills. Team formation problem is translated to finding possible authors for the given paper, who have the required skills and having least communication cost. In the process, we build a much larger bench-mark data set from DBLP for team formation for experimentation. Even though the benchmark algorithm Rarestfirst takes least time, our algorithms TFC-N and TFC-R give much better communication cost. They also outperform the standard algorithms like MinLD and MinSD with respect to the time taken in finding a team. The time taken by our algorithms on communities are several orders faster than the time taken on the larger network without compromising too much on the communication cost.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑