{'fraction_non_alphanumeric': 0.0234192037470726, 'fraction_numerical': 0.0, 'mean_word_length': 4.777027027027027, '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 Note on Even-Sized Clustering Based on Optimization

Some clustering methods to classify a dataset into some clusters of which the size is more than a constant K have been proposed until now. The methods are called K-member clustering and very useful for many applications. It is natural to consider clustering methods to classify a dataset into even-sized clusters, and actually, such methods have been also proposed. However, they often output inadequate results. It is considered that the reason is that they are not based on optimization. Therefore, in the previous study, we proposed Even-sized Clustering Based on Optimization (ECBO). We improved the clustering results by the simplex method to calculate the membership grade. In this study, we propose some types of extended ECBO by introducing some concept of medoid and kernel to improve ECBO.