当离群成员离开时,如何优化学术团队?
How to optimize an academic team when the outlier member is leaving?
摘要:
学术团队是一个高度凝聚力的学者合作群体,它被认为是提高科学产出质量和数量的有效途径。然而,高员工流动率带来的一系列问题可能会对团队绩效产生负面影响。为了应对这一挑战,我们首先检测可能离开的成员的趋势。在这里,离群值是相对于熟悉度来定义的,熟悉度是通过使用协作强度来量化的。假设如果团队成员与团队外的学者有更高的熟悉度,那么该成员可能会离开团队。为了最大限度地减少离群成员的离开所造成的影响,我们提出了一种优化解决方案,以找到一个合适的候选人谁可以取代离群成员。基于图核随机游走,我们的解决方案涉及熟悉度匹配,技能匹配,以及结构匹配。该方法在应用于计算机科学学术团队时,证明是有效的,优于现有的方法。
英文摘要:
An academic team is a highly-cohesive collaboration group of scholars, which has been recognized as an effective way to improve scientific output in terms of both quality and quantity. However, the high staff turnover brings about a series of problems that may have negative influence on team performance. To address this challenge, we first detect the tendency of the member who may potentially leave. Here the outlierness is defined with respect to familiarity, which is quantified by using collaboration intensity. It is assumed that if a team member has a higher familiarity with scholars outside the team, then this member might probably leave the team. To minimize the influence caused by the leaving of such an outlier member, we propose an optimization solution to find a proper candidate who can replace the outlier member. Based on random walk with graph kernel, our solution involves familiarity matching, skill matching, as well as structure matching. The proposed approach proves to be effective and outperforms existing methods when applied to computer science academic teams.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。