{'fraction_non_alphanumeric': 0.023968042609853527, 'fraction_numerical': 0.0, 'mean_word_length': 5.163934426229508, '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}}
Ensemble-based multi-objective clustering algorithms for gene expression data sets

In this paper, two multi-objective clustering ensemble algorithms are proposed named MOCLED and MOCNCD. MOCLED is different from MOCLE on three points. First, different clustering algorithms are used to produce some new individuals in evolutionary process. Second, a new screening mechanism is added. In each generation, the worst individual is replaced by the best individual. Third, a new objective function is added to ensure a diverse population. MOCNCD is the same as MOCLED except the crossover operator. We replace it with a new proposed cluster ensemble algorithm, IDICLENS. Experimental results reveal the advantages of our method on finding good partitions.