Given a task T, a pool of experts X with different skills, and a social network G that captures social relationships and various interactions among these experts, we study the problem of finding a wise group of experts X'<,a subset of X, to perform the task. We call this the Expert Group Formation problem in this paper. In order to reduce various potential social influence among team members and avoid following the crowd, we require that the members of X' not only meet the skill requirements of the task, but also be diverse. To quantify the diversity of a group of experts, we propose one metric based on the social influence incurred by the subgraph in G that only involves X'. We analyze the problem of Diverse Expert Group Formation and show that it is NP-hard. We explore its connections with existing combinatorial problems and propose novel algorithms for its approximation solution. To the best of our knowledge, this is the first work to study diversity in the social graph and facilitate its effect in the Expert Group Formation problem. We conduct extensive experiments on the DBLP dataset and the experimental results show that our framework works well in practice and gives useful and intuitive results.
展开▼
