{'fraction_non_alphanumeric': 0.010011123470522803, 'fraction_numerical': 0.0, 'mean_word_length': 5.870229007633588, '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 Novel Similarity Measurement for Community Structure Detection

How to identify community structure is a fundamental problem for analysis of complex network. In this paper we propose a novel similarity matrix of the nodes for this purpose, which combines the information of adjacency matrix and common-neighbors matrix. We compare it with diffusion kernel similarity and adjacency matrix using several algorithms which are widely used in detecting community structure, including the standard nonnegative matrix factorization, symmetric nonnegative matrix factorization and spectral clustering. The results performed on the synthetic benchmark networks show that the novel similarity matrix is relatively effective to find the community structures in networks with heterogeneous distribution of node degrees and community sizes, and this effectiveness is also manifested on the real world networks.