{'fraction_non_alphanumeric': 0.017057569296375266, 'fraction_numerical': 0.0, 'mean_word_length': 5.566433566433567, '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}}
Scalable Affinity Propagation for Massive Datasets

Affinity Propagation (AP) is a fundamental algorithm to identify clusters included in data objects.
Given a similarities among objects, it iteratively performs message updates between all data object pairs until convergence.
Although AP yields a higher clustering quality compared with other methods, it is computationally expensive.
Hence, it has difficulty handling massive datasets that include numerous data objects.
This is because the message updates require a quadratic cost of the number of data objects.
Here, we propose a novel fast algorithm, ScaleAP, which outputs the same clusters as AP but within a shorter computation time.
ScaleAP dynamically excludes unnecessary message updates without sacrificing its clustering accuracy.
Our extensive evaluations demonstrate that ScaleAP outperforms existing AP algorithms in terms of running time by up to two orders of magnitude.