{'fraction_non_alphanumeric': 0.014505893019038985, 'fraction_numerical': 0.0, 'mean_word_length': 5.237288135593221, '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}}
An Efficient Algorithm for Overlapping Community Detection in Complex Networks

Community structure is an important property of the complex networks. How to detect the communities is significant to understand the network structure and analyze the network properties. Many algorithms, such as K-L and GN, have been proposed to detect the community structure in complex networks. However, the communities detected by these algorithms are always not overlapping. According to daily experience, a node in the network may belong to several communities and a community should have many nodes and connections. Based on these principals and existing researches, an efficient algorithm for overlapping community detection in complex networks is proposed in this paper. The key strategy of the algorithm is to mine a node with the closest relations with the community and assign it to the community. Some real-world networks are used to test the performance of the algorithm. Experimental results demonstrate that the algorithm proposed is rather efficient to detect the overlapping community in complex networks.