{'fraction_non_alphanumeric': 0.017543859649122806, 'fraction_numerical': 0.0, 'mean_word_length': 5.061946902654867, '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}}
Dealing with noise in ant-based clustering

Separating the noise from data in a clustering process is an important issue in practical applications. Various algorithms, most of them based on density functions approaches, have been developed lately. The aim of this work is to analyze the ability of an ant-based clustering algorithm (AntClust) to deal with noise. The basic idea of the approach is to extend the information carried by an ant with information concerning the density of data in its neighborhood. Experiments on some synthetic test data suggest that this approach could ensure the separation of noise from data without significantly increasing the algorithm's complexity.