{'fraction_non_alphanumeric': 0.017179023508137433, 'fraction_numerical': 0.0, 'mean_word_length': 5.550295857988166, '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}}
Dynamic Self-Organising Swarm for Unsupervised Prototype Generation

Growing big data has posed a great challenge for machine learning algorithms. To cope with big data, the algorithm has to be both efficient and accurate. Although evolutionary computation has been successfully applied to many complex machine learning tasks, its ability to handle big data is limited. In this paper, we proposed a dynamic self-organising swarm algorithm to learn an effective set of prototypes for big high-dimensional datasets in an unsupervised manner. The novelties of this new algorithm are the energy-based fitness function, the adaptive topological neighbourhood, the growing/shrinking capability, and the efficient learning scheme. Experiments with well-known datasets show that the proposed algorithm can maintain a very compact set of prototypes and achieve competitive predictive performance as compared to other algorithms in the literature. The analyses also show that prototypes generated by the proposed algorithms have a stronger separatability compared to those from other prototype generation algorithms.