{'fraction_non_alphanumeric': 0.02490170380078637, 'fraction_numerical': 0.0, 'mean_word_length': 5.52991452991453, '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}}
Contextual Hausdorff dissimilarity for multi-instance clustering

The multi-instance clustering problem has been emerging in kinds of applications. A straightforward solution is to adapt the classical single-instance clustering algorithms such as k-mediods to the setting of it. In this way, the essential step is the dissimilarity measurement between multi-instance bags. Traditional distances fail to capture the differences between bags. This paper proposes a new type of bag dissimilarity, namely, contextual Hausdorff dissimilarity (CHD). Then a multi-instance clustering algorithm based on CHD is introduced. Experimental results on both synthetic data and real-world data sets show that the proposed CHD outperforms the traditional Hausdorff dissimilarity.