{'fraction_non_alphanumeric': 0.013579049466537343, 'fraction_numerical': 0.0, 'mean_word_length': 5.216867469879518, '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 Parallel Algorithm to Find Overlapping Community Structure in Directed and Weighted Complex Networks

Based on the BSP (Bulk Synchronous Parallel) computing framework, this paper proposes a parallel algorithm to find overlapping community structure in directed and weighted complex networks. The algorithm is composed of four parts, job distribution, finding natural communities, passing information in cluster and merging the similar natural communities. The main idea of the algorithm is finding the local maxima of a modularity function by local, iterative search to ensure that each vertex in network at least belongs to one natural community. By iteratively merging the similar natural communities we get a series of schemes and choose the scheme which results in the maximum modularity as the best scheme. By using Hama which is a pure BSP computing framework, we conduct experiments in several real networks. The results show the algorithm can give an original scheme very fast and give the best scheme with high accuracy.