{'fraction_non_alphanumeric': 0.022629310344827586, 'fraction_numerical': 0.0, 'mean_word_length': 5.984962406015038, '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}}
A review on overlapping community detection methodologies

Community Detection is a prominent task in social network analysis. Community detection helps us to determine users with common interests or to find a set of similar people based on point of interest. The community detection is useful in many applications such as: recommendation systems, viral marketing, stock market prediction, influential user identification, finding domain expert and many more. In this paper, we provide a comprehensive survey on recent methodologies for overlapping community detection that are based on various factors viz: topological features, accuracy, density, centrality, betweenness, computational speed, modularity and Normalized Mutual Information (NMI). The detailed description of the challenges being addressed by various researchers is presented. The comparative analysis of overlapping community detection methods is also reported.