{'fraction_non_alphanumeric': 0.024691358024691357, 'fraction_numerical': 0.0008818342151675485, 'mean_word_length': 4.82051282051282, '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}}
Improved K-means Based on Density Parameters and Normalized Distance

The existing K-means has problems such as random selection of initial cluster centers, sensitivity to outliers, and inability to unify the data size. In this paper we describe a new improved K-means based on density parameters and normalized distance (K-DPND) we developed that addresses these problems. In the stage of selecting the initial cluster centers, K-DPND constructs a density parameter set according to the distance matrix and the average distance of the data set, selects the largest density parameter point as the cluster center, sets the density parameter of the point whose distance from this cluster center is less than the average distance to 0. Then loops until k initial cluster centers are found. In the clustering stage, the normalized distance is used to replace the Euclidean distance to calculate to determine the cluster to which each point belongs, and the median is used to replace the mean to calculate the new cluster center. Finally, compared with K-means, K-mediods, IK-DM and KICIC, K-DPND has good clustering results in most cases.