Finding a team of experts in social networks Export

@inproceedings{citeulike:5043998, abstract = {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 T EAM F ORMATION 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 T EAM F ORMATION 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.}, address = {New York, NY, USA}, author = {Lappas, Theodoros and Liu, Kun and Terzi, Evimaria}, booktitle = {KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining}, citeulike-article-id = {5043998}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1557019.1557074}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1557019.1557074}, comment = {Describes a team formation problem and present algorithms to solve it.}, doi = {10.1145/1557019.1557074}, isbn = {978-1-60558-495-9}, keywords = {ranking, social}, location = {Paris, France}, pages = {467--476}, posted-at = {2009-07-03 09:26:43}, priority = {2}, publisher = {ACM}, title = {Finding a team of experts in social networks}, url = {http://dx.doi.org/10.1145/1557019.1557074}, year = {2009} }

TY - CONF ID - citeulike:5043998 L3 - citeulike-article-id:5043998 N2 - 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 T EAM F ORMATION 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 T EAM F ORMATION 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. CY - Paris, France SN - 978-1-60558-495-9 AD - New York, NY, USA EP - 476 TI - Finding a team of experts in social networks PB - ACM T2 - KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining SP - 467 KW - ranking KW - social N1 - Describes a team formation problem and present algorithms to solve it. AU - Lappas, Theodoros AU - Liu, Kun AU - Terzi, Evimaria PY - 2009/// UR - http://dx.doi.org/10.1145/1557019.1557074 ER -