{'fraction_non_alphanumeric': 0.017857142857142856, 'fraction_numerical': 0.0, 'mean_word_length': 5.229166666666667, '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 distributed approach to fuzzy clustering by genetic algorithms

Fuzzy clustering (c-means) is a widely known unsupervised clustering algorithm, but it can not guarantee to find the global minimum, because it approximates the minimum of an objective function by the iterative method in solving the differentiation problem, starting from a given point. For overcoming this drawback, we incorporate the genetic search strategies in the fuzzy clustering algorithm to explore the data space from a multiple-point concept. The direct application of the genetic algorithms to the fuzzy clustering is not suitable, because sometimes the data set is enormous. Under this situation, the chromosome would be too long, so a distributed approach to fuzzy clustering by genetic algorithms is proposed to divide the huge search space into many small ones. The simulation results show our algorithm works fine.