Abstract

The advent of social and collaboration networks has resulted in different methods of forming large groups to deal with complex tasks. Team Formation (TF) in online social networks is crucial in several applications, such as collaborative software development and community based question and answer forums. The problem involves the formation of expert teams from a social network who can collaborate effectively under multiple constraints. In a practical scenario, the problem involves a minimization of the following major objectives: communication cost, expert cost and the size of the team. The minimization is performed by finding Pareto-Optimal teams, in which no team dominates the solution teams in terms of the three chosen objectives. Existing approaches use approximation algorithms and cannot be easily extended to incorporate additional objectives. Therefore, an optimization framework the Non-dominated Sorting Genetic Algorithm for Team Formation (NSGA-II TF) is proposed which is robust and extensible. A mapping scheme is defined for representing the chromosome in the NSGA-II algorithm to satisfy the constraints of the TF problem. The scalability, precision and recall for NSGA-II TFare evaluated and it is observed that it results in teams with minimized cardinality, communication and expert cost.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.