{'fraction_non_alphanumeric': 0.024691358024691357, 'fraction_numerical': 0.007716049382716049, 'mean_word_length': 5.555555555555555, '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}}
Computing exact clustering posteriors with subset convolution

ABSTRACT An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed for summary statistics: the number of clusters and pairwise co-occurrence. The method is based on subset convolution and yields the posterior distribution for the number of clusters in O(n3n) operations or O(n32n) using fast subset convolution. Pairwise co-occurrence probabilities are then obtained in O(n32n) operations. This is considerably faster than exhaustive enumeration of all partitions.