{'fraction_non_alphanumeric': 0.016551724137931035, 'fraction_numerical': 0.0, 'mean_word_length': 5.6, '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 New Algorithm of Detecting Communities by Topological Centrality

Community structure is an important common property of complex network which has much theoretical significance for analyzing structure, mastering function, detecting implicit scheme and predicting activities. This paper reviews some popular detecting community methods. NTCDC Algorithm is proposed by analyzing weigh of nodes’ and edges’ TC values. The algorithm not only improves the precision, but also faster than GN and fast algorithm proposed by Newman. This paper demonstrate that the algorithm is higher effective and faster at discovering community structure in both computer-generated network and real-world network data than GN and fast algorithm.