{'fraction_non_alphanumeric': 0.009825327510917031, 'fraction_numerical': 0.0, 'mean_word_length': 4.80379746835443, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Team formation in social networks based on local distance metric

The tremendous growth of social networking in last decades has resulted in an extensive research into this area. Social network users are enabled to easily communicate and collaborate with each other. Due to the significant role of network users, a new research topic in social networking analysis is team formation. The social network is modeled as a graph where nodes represent experts and edges show the initial collaborations between experts. The present research aims to tackle the problem to find an expert team in social network in order to complete a project that requires a set of skills. An algorithm is thus proposed to find the best suited team for the assigned project: a new method is devised as well to determine the distance between pairs of experts. Experimental results on DBLP dataset present the efficiency of our proposed method.