{'fraction_non_alphanumeric': 0.016467065868263474, 'fraction_numerical': 0.0, 'mean_word_length': 5.194444444444445, '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 comparative study between fuzzy c-means and ckMeans algorithms

Clustering is a useful approach in data mining, image segmentation, and other problems of pattern recognition. Fuzzy clustering process can be quite slow when there are many objects or pattern to be clustered. This article discusses about an algorithm, ckMeans, which is able to reduce the number of distinct patterns which must be clustered without adversely affecting partition quality. The reduction is done by calculating a new mathematical equation to obtaining center cluster. To validate the proposed methodology we compared the original fuzzy c-means algorithm with that proposed in this paper.