{'fraction_non_alphanumeric': 0.014566181127295756, 'fraction_numerical': 0.0, 'mean_word_length': 5.100386100386101, '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}}
An adaptive crossover-imaged clustering algorithm

The grid-based clustering algorithm is an efficient clustering algorithm, but its effect is seriously influenced by the size of the predefined grids and the threshold of the significant cells. The data space will be partitioned into a finite number of cells to form a grid structure and then performs all clustering operations on this obtained grid structure. To cluster efficiently and simultaneously, to reduce the influences of the size of the cells and inherits the advantage with the low time complexity, an Adaptive Crossover-Imaged Clustering Algorithm, called ACICA, is proposed in this paper. The main idea of ACICA algorithm is to deflect the original grid structure in each dimension of the data space after the image of significant cells generated from the original grid structure have been obtained. Because the deflected grid structure can be considered a dynamic adjustment of the size of original cells and the threshold of significant cells, the new image generated from this deflected grid structure will be used to revise the originally obtained significant cells. Hence, the new image of significant cells is projected on the original grid structure to be the crossover image. Finally the clusters will be generated from this crossover image. The experimental results verify that, indeed, the effect of ACICA algorithm is less influenced by the size of the cells than other grid-based algorithms. Finally, we will verify by experiment that the results of our proposed ACICA algorithm outperforms than others.