{'fraction_non_alphanumeric': 0.021181716833890748, 'fraction_numerical': 0.0, 'mean_word_length': 5.602941176470588, '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}}
DSET++: A robust clustering algorithm

Clustering image pixels is an important technique in image segmentation. While normalized cuts is popularly used in image segmentation, dominant set clustering is another promising method and shown to outperform normalized cuts in some experiments. However, dominant set clustering suffers from the problems of sensitiveness to distance measures and over-segmentation tendency. In this paper we present DSET++ to enhance the original dominant set clustering and solve the two problems. Firstly, we use the histogram equalization in image enhancement to transform the similarity matrix and eliminate the sensitiveness to distance measures. In the second step we extend the dominant set based on density information to overcome the tendency of over-segmentation. Preliminary experiments on data clustering tasks validate the effectiveness of DSET++ clustering.