{'fraction_non_alphanumeric': 0.022988505747126436, 'fraction_numerical': 0.0, 'mean_word_length': 5.185792349726776, '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}}
Top-down vs bottom-up methods of linkage for asymmetric agglomerative hierarchical clustering

Algorithms of agglomerative hierarchical clustering using asymmetric similarity measures are studied. We classify linkage methods into two categories of bottom-up methods and top-down methods. The bottom-up methods first defines a similarity measure between two object, and extends it to similarity between clusters. In contrast, top-down methods directly define similarity between clusters. In classical linkage methods based on symmetric similarity measures, the single linakge, complete linkage, and average linkage are bottom-up, while the centroid method and the Ward methods are top-down. We propose two a top down method and a family of bottom-up method using asymmetric similarity measures. A dendrogram which is the output of hierarchical clustering often has reversals. We show conditions that dendrogram have no reversals. It is proved that the proposed methods have no reversals in the dendrograms. Two different techniques to show asymmetry in the dendrogram are used. Examples based on real data show how the methods work.