{'fraction_non_alphanumeric': 0.01084010840108401, 'fraction_numerical': 0.0, 'mean_word_length': 5.718181818181818, '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}}
Clustering of moving vectors for evolutionary computation

We propose a method for clustering moving vectors oriented around two different local optima and some methods for improving the clustering performance. Evolutionary computation is an optimization method for finding the global optimum iteratively using multiple individuals; we propose a method for estimating the global optimum mathematically using the moving vectors between parent individuals and their offspring. Our proposed clustering method is the first to tackle the extension of the estimation method to multi-modal optimization. We describe the algorithm of the clustering method, the improvements made to the method, and the estimation performance for two local optima.