{'fraction_non_alphanumeric': 0.015918958031837915, 'fraction_numerical': 0.0, 'mean_word_length': 5.528301886792453, '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 robust semi-supervised EM-based clustering algorithm with a reject option

In this paper we address the problem of semi-supervision in the framework of parametric clustering by using labeled and unlabeled data together Clustering algorithms can take advantage from few labeled instances in order to tune parameters, improve convergence and overcome local extrema due to bad initialization. We extend a robust parametric clustering algorithm able to manage outlier rejection to the semi-supervision approach. This is achieved by modifying the expectation-maximization algorithm. The proposed method shows good performance with respect to data structure discovering, even facing to outliers.