{'fraction_non_alphanumeric': 0.026604068857589983, 'fraction_numerical': 0.0, 'mean_word_length': 4.981308411214953, '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 Method of Eliminating Noise Based on Clustering

Clustering is often constructed on noise-free datasets. In real-world applications, it is inevitable that the datasets contain noises, which may result in unsatisfactory results of the clustering algorithms. In this paper, several methods of reducing noises are systemic introduced, and at the first time we propose a heuristic algorithm of reducing noises in clustering theory (GK-means). The empirical results show that GK-means is simpler and more precise, and can handle noises in the real-world database effectively. Some samples are used to prove the validity of this algorithm.