By Topic

Toward forming an effective team using social network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kamel, K. ; Dept. of Electr. & Comput. Eng., Univ. of Sharjah, Sharjah, United Arab Emirates ; Tubaiz, N. ; AlKoky, O. ; AlAghbari, Z.

In this paper, we propose an algorithm for selecting a team of experts from a social network, which is represented by a weighted undirected graph. Each node in the graph represents an individual who has one or more skills. Different individuals can have the same skill but they might differ in their level of expertise (e.g., novice, medium, or expert). The communication cost between two individuals (nodes) is represented by the weight of the common edge (or path). The objective is to create an effective team that can carry out a specific task. The task is represented as a set of skills with specific level of expertise for each skill. An effective solution should suggest a set of individuals (nodes) who collectively meet the level of skillfulness required and at the same time guarantee low communication cost. We implemented the proposed algorithm and ran many simulation experiments to measure the cost effectiveness of the proposed algorithm.

Published in:

Innovations in Information Technology (IIT), 2011 International Conference on

Date of Conference:

25-27 April 2011