{'fraction_non_alphanumeric': 0.015151515151515152, 'fraction_numerical': 0.0, 'mean_word_length': 5.519736842105263, '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 Kernel-Based Method for Semi-Supervised Learning

In recent years there has been growing interest in applying techniques that incorporate knowledge from unlabeled data into systems performing supervised learning. The main motivation for this is the belief that classification performance can be improved by utilizing the contextual information provided by unlabeled data. This paper approaches the problem from a generative classifier perspective, and proposes a new kernel-based method based on combining likelihoods from the labeled examples with those of unlabeled examples. Preliminary results on synthetic low-dimensional data show that the performance of the technique is comparable to that of existing semi-supervised generative approaches based on mixture models trained using Expectation-Maximization. However, a distinct advantage of the proposed approach is that it relies on optimizing only a single parameter. The paper describes how this can be done using cross- validation.