DocumentCode :
3025063
Title :
Team formation with time limit in social networks
Author :
Yan Yang ; Haiyue Hu
Author_Institution :
Sch. of Comput. Sci. & Technol., Heilongjiang Univ., Harbin, China
fYear :
2013
fDate :
20-22 Dec. 2013
Firstpage :
1590
Lastpage :
1594
Abstract :
Team formation is finding a team of experts in a social network to complete a given task. In many tasks, there is a deadline to complete them. Previous research work doesn´t consider this point. In this paper, an attribute time is considered in team formation problem. For an expert completing a skill will cost some time. To complete a task, experts should communicate with each other, which will cost some time too. This paper is the first to consider these two elements and define a new cost model TotalCost. Based on the new cost model, we propose two approximation algorithms. The objective is to find a team not only covers the skills that the task requires as well as completes every skill in the specified time and minimize TotalCost. Experimental results show that the team built by our methods satisfies the given task and with a low TotalCost.
Keywords :
approximation theory; social networking (online); TotalCost; approximation algorithms; attribute time; social networks; team formation problem; Algorithm design and analysis; Approximation algorithms; Approximation methods; Educational institutions; NP-hard problem; Partitioning algorithms; Social network services; TotalCost; social network; team formation; time limit;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechatronic Sciences, Electric Engineering and Computer (MEC), Proceedings 2013 International Conference on
Conference_Location :
Shengyang
Print_ISBN :
978-1-4799-2564-3
Type :
conf
DOI :
10.1109/MEC.2013.6885315
Filename :
6885315
Link To Document :
بازگشت