Abstract
Why is a team greater than the sum of its members’ capabilities? Forging a team depends upon solid collaboration among the team members amalgamated with each member’s abilities. These two aspects challenge finding the right mix of members with a novel notion of Synergy from Graph G. This notion has three main goals:
(i) introducing the concept of Team Synergy Problem (TSP) and proposing a novel function, (ii) identifying the intrinsic structure of G for predicting potential Systems, and (iii) developing a top-k Team Synergy Algorithm (TSA).
Specifically, the TSP can be formulated by embedding three essential elements, Communication, Cooperativeness, and Complementarity to quantify the Synergy between adjacent experts, construct a Synergy graph, GS. We can prove that the TSP is NP-hard and propose TSA to form top-k teams from GS within a budget B. TSA uses PSEUDO-STAR configurations to prune instances efficiently. Moreover, it uses a tensor decomposition method, RESCAL, to exploit the tensored Synergy graph to predict the potential Synergies on the unknown edges and recommend new teammates to a given team.
The experimental results can be viewed by several real datasets, which can be shown that TSA significantly outperforms the state-of-the-art algorithms so far.