Abstract

Collaboration networks are social networks in which nodes represent experts, and edges represent the interactions between them. Team Formation Problem (TFP) in Social Networks (SN) is to construct a group of individuals to work on complex tasks. Teams should satisfy the skill set required by the tasks and can collaborate effectively under multiple constraints. Although many algorithms have been proposed to confront the TFP, most of them optimize different criteria and various parameters (e.g. communication cost or expertise level). There is no unified framework to incorporate the most significant parameters towards formulating effective teams of experts. We propose a unified framework for the TFP in SN based on a multi-objective cultural algorithm that involves the integration of essential cost functions such as communication cost, expertise level, collective trust score, and geological proximity. Since these are conflicting objectives, we return a set of Pareto front of teams that are not dominated by other feasible teams with regards to any of the objectives. Moreover, we examine the temporal nature of both communication costs and expertise levels in our model and introduce a new method to formulate them. We introduce a profile similarity formula to express the trust score. We then discuss the importance of emotional index in TFP. Our model is tested on a benchmark table, which is generated with various criteria of social networks. Our model is then compared with NSGA II, Graph-Based and Exhaustive search.

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.