替代不可替代的:团队成员推荐的快速算法
Replacing the Irreplaceable: Fast Algorithms for Team Member Recommendation
摘要:
在本文中,我们研究了团队成员替换问题:给定一个嵌入在社会网络中的团队成员,在同一任务上工作,找到一个好的候选人谁可以适应团队后,一个团队成员变得不可用。我们推测,一个好的团队成员更换应该有良好的技能匹配以及良好的结构匹配。我们制定这个问题使用的概念图内核。为了解决计算的挑战,我们提出了一个家庭的快速算法(a)设计有效的修剪策略,和(b)探索现有的和新的团队结构之间的平滑度。我们在真实世界的数据集上进行了广泛的实验评估,以证明其有效性和效率。我们的算法(a)在精确度和召回率方面都比其他选择表现得更好;(b)次线性扩展。
英文摘要:
In this paper, we study the problem of Team Member Replacement: given a team of people embedded in a social network working on the same task, find a good candidate who can fit in the team after one team member becomes unavailable. We conjecture that a good team member replacement should have good skill matching as well as good structure matching. We formulate this problem using the concept of graph kernel. To tackle the computational challenges, we propose a family of fast algorithms by (a) designing effective pruning strategies, and (b) exploring the smoothness between the existing and the new team structures. We conduct extensive experimental evaluations on real world datasets to demonstrate the effectiveness and efficiency. Our algorithms (a) perform significantly better than the alternative choices in terms of both precision and recall; and (b) scale sub-linearly.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。