| dc.contributor | 資科系 | |
| dc.creator (作者) | Shan, Man-kwan;Li, Cheng-Te | |
| dc.creator (作者) | 沈錳坤 | zh_TW |
| dc.date (日期) | 2010 | |
| dc.date.accessioned | 17-六月-2015 16:22:59 (UTC+8) | - |
| dc.date.available | 17-六月-2015 16:22:59 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-六月-2015 16:22:59 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75904 | - |
| dc.description.abstract (摘要) | Given an expertise social network and a task consisting of a set of required skills, the team formation problem aims at finding a team of experts who not only satisfy the requirements of the given task but also communicate to one another in an effective manner. To solve this problem, Lappas et al. has proposed the Enhance Steiner algorithm. In this work, we generalize this problem by associating each required skill with a specific number of experts. We propose three approaches to form an effective team for the generalized task. First, we extend the Enhanced-Steiner algorithm to a generalized version for generalized tasks. Second, we devise a density-based measure to improve the effectiveness of the team. Third, we present a novel grouping-based method that condenses the expertise information to a group graph according to required skills. This group graph not only drastically reduces the search space but also avoid redundant communication costs and irrelevant individuals when compiling team members. Experimental results on the DBLP dataset show the teams found by our methods performs well in both effectiveness and efficiency. | |
| dc.format.extent | 130 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | IEEE International Conference on Social Computing - SocialCom , pp. 9-16 | |
| dc.title (題名) | Team Formation for Generalized Tasks in Expertise Social Networks | |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1109/SocialCom.2010.12 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/SocialCom.2010.12 | |
