{'fraction_non_alphanumeric': 0.01787487586891758, 'fraction_numerical': 0.0, 'mean_word_length': 5.072289156626506, '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 clustering algorithm based on CFSFDP

The main idea of the recent proposed clustering by fast search and find of density peaks (CFSFDP) clustering algorithm depicts the cluster center with the local density and distance and it achieves significant effects in typical applications. But it can't select the cluster centers adaptively. Therefore, an improved CFSFDP algorithm is proposed in this paper, which determines the cluster centers by the Max-min algorithm. First, the Max-min algorithm is introduced to obtain the number of categories. Then the local density and distance information is used to determine the cluster centers as do in CFSFDP algorithm. It can not only adaptively obtain categories number of the data, but also obtain the corresponding clustering centers. The simulation results show that the proposed algorithm can find the number of categories and find the cluster centers. Meanwhile, it can find the cluster centers which are hard to be obtained through decision diagram.