{'fraction_non_alphanumeric': 0.025056947608200455, 'fraction_numerical': 0.0, 'mean_word_length': 5.369565217391305, '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}}
Multi-Agent Evolutionary Clustering Algorithm Based on Manifold Distance

By using the manifold distance as the similarity measurement, a multi-agent evolutionary clustering algorithm based on manifold distance (MAEC-MD) is proposed in this paper. MAEC-MD designs a new connection based encoding, and the clustering results can be obtained by the process of decoding directly. It does not require the number of clusters to be known beforehand and overcomes the dependence of the domain knowledge. Aim at solving the clustering problem, three effective evolutionary operators are designed for competition, cooperation, and self-learning of an agent. Some experiments about artificial data, UCI data are tested. These results show that MAEC-MD can confirm the number of clusters automatically, tackle the data with different structures, and satisfy the diverse clustering request.