{'fraction_non_alphanumeric': 0.019255455712451863, 'fraction_numerical': 0.007702182284980745, 'mean_word_length': 5.5, '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}}
DBSCALE: An efficient density-based clustering algorithm for data mining in large databases

This work presents a novel clustering algorithm that incorporates neighbor searching and expansion seed selection into a density-based clustering algorithm. Data Points that have been clustered need not be input again when searching for neighborhood data points, and the algorithm redefines eight Marked Boundary Objects to add expansion seeds according to far centrifugal force, which increases coverage. Experimental results indicate that the proposed DBSCALE has a lower execution time cost than DBSCAN, mBSCAN and KIDBSCAN clustering algorithms. DBSCALE has a maximum deviation in clustering correctness rate of 0.29%, and a maximum deviation in noise data clustering rate of 0.14%.