{'fraction_non_alphanumeric': 0.02627511591962906, 'fraction_numerical': 0.0, 'mean_word_length': 4.890909090909091, '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}}
The K-Exemplars Clustering Method

In order to apply the concepts of k-means to deal with any specified dissimilarity measures, we propose a k-exemplars clustering method that modifies k-means by restricting the cluster centers on data points. The proposed method not only has similar clustering accuracy as k-means but also faster convergence. According to the definition of the objective function of k-exemplars, the proposed method can be used to deal with a relational data set, and the cluster centers (exemplars) of each cluster will also be extracted. Hence, the k-exemplars can work in an environment with specified dissimilarity measures.