0


在社交网络中寻找专家团队

Finding a Team of Experts in Social Networks
课程网址: http://videolectures.net/kdd09_lappas_fatoe/  
主讲教师: Theodoros Lappas
开课单位: 加利福尼亚大学
开课时间: 2009-09-14
课程语种: 英语
中文简介:
给定任务T,具有不同技能的个体X池以及捕获这些个体之间的兼容性的社交网络G,我们研究找到X(X的子集)来执行任务的问题。我们将此称为团队形成问题。我们要求X的成员不仅满足任务的技能要求,而且还可以作为一个团队有效地一起工作。我们使用G中仅包含X的子图所产生的通信成本来衡量有效性。我们针对两种不同的通信成本函数研究了问题的两种变体,并证明两种变体都是NP难的。我们探索它们与现有组合问题的联系,并为其解决方案提供新颖的算法。据我们所知,这是第一个在个人社交网络中考虑团队形成问题的工作。 DBLP数据集上的实验表明,我们的框架在实践中运行良好,并提供有用和直观的结果。
课程简介: Given a task T, a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X, a subset of X, to perform the task. We call this the Team Formation problem. We require that members of X not only meet the skill requirements of the task, but can also work effectively together as a team. We measure effectiveness using the communication cost incurred by the subgraph in G that only involves X. We study two variants of the problem for two different communication-cost functions, and show that both variants are NP-hard. We explore their connections with existing combinatorial problems and give novel algorithms for their solution. To the best of our knowledge, this is the first work to consider the Team Formation problem in the presence of a social network of individuals. Experiments on the DBLP dataset show that our framework works well in practice and gives useful and intuitive results.
关 键 词: 团队形成问题; 通信成本函数; 社交网络
课程来源: 视频讲座网
最后编审: 2019-05-10:lxf
阅读次数: 58