SmartRecruiter: a similarity-based team formation algorithm Online publication date: Mon, 24-Oct-2016
by Ibrahim Kamel; Zaher Al Aghbari; Kareem Kamel
International Journal of Big Data Intelligence (IJBDI), Vol. 3, No. 4, 2016
Abstract: This paper presents a realistic team formation algorithm that navigates through a social network graph to select a team of experts to work in a target project. The project is represented with a set of skills that are required for the project implementation. Each node in the graph represents an individual who has one or more skills. Individuals (nodes) connect with friends who might share some common skills. Unlike most of the prior works in this area, the proposed algorithm assumes a local view of the network resulting in an absence of pre-computed network statistics. The proposed algorithm uses homophily in navigation to reach to relevant nodes. We use a distance function to quantify the similarity between two skills guided by WordNet ontology. The experiments show that the proposed algorithm reaches to the required team in up to 20% less hubs than the breadth first search.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Big Data Intelligence (IJBDI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com