{'fraction_non_alphanumeric': 0.023289665211062592, 'fraction_numerical': 0.0, 'mean_word_length': 5.745098039215686, '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}}
A novel information-theoretic clustering algorithm for robust, unsupervised classification

A new information-theoretic, unsupervised, subtractive clustering algorithm is proposed. The algorithm eliminates threshold constraint to detect possible cluster members. Cluster centers are formed with minimum entropy. Instead of using a fixed-threshold, a decision region is formed with the use of maximum mutual information. Cluster members are chosen with a relative-cost assigned in partitions of data set. The algorithm yields more reliably distributed cluster numbers in statistical sense, hence reducing further computation for validation, which is justified for a set of synthetic data.