{'fraction_non_alphanumeric': 0.013527575442247659, 'fraction_numerical': 0.0, 'mean_word_length': 5.7272727272727275, '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 neighborhood vector propagation algorithm for community detection

Community detection is an important technique to understand the structure of complex social networks. Many approaches have been devised to extract community structures in recent years. In this paper we propose a novel neighborhood vector propagation algorithm (NVPA) to detect communities in a social network which has greater accuracy than algorithms in the literature. In our approach, a neighborhood vector is proposed to store the neighborhood information, and a vector propagation algorithm is designed to disseminate neighborhood information to other nodes. After neighborhood propagation, hierarchical clustering is used to find the community structure based on similarity measures. We apply our algorithm on two real-world networks and LRF benchmark networks. Experimental results show that our algorithm achieves greater accuracy than several well known algorithms in the literature.