A generative semi-supervised classifier for datasets with unknown classes

Abstract

Classification has been tackled by a large number of algorithms, predominantly following a supervised learning setting. Surprisingly little research has been devoted to the problem setting where a dataset is only partially labeled, including even instances of entirely unlabeled classes. Algorithmic solutions that are suited for such problems are especially important in practical scenarios, where the labelling of data is prohibitively expensive, or the understanding of the data is lacking, including cases, where only a subset of the classes is known. We present a generative method to address the problem of semi-supervised classification with unknown classes, whereby we follow a Bayesian perspective. In detail, we apply a twostep procedure based on Bayesian classifiers and exploit information from both a small set of labeled data in combination with a larger set of unlabeled training data, allowing that the labeled dataset does not contain samples from all present classes. This represents a common practical application setup, where the labeled training set is not exhaustive. We show in a series of experiments that our approach outperforms state-of-the-art methods tackling similar semi-supervised learning problems. Since our approach yields a generative model, which aids the understanding of the data, it is particularly suited for practical applications.

Cody: An AI-Based System to Semi-Automate Coding for Qualitative Research

“…Introducing artifcial negatives (greygoo labels) also enables the algorithm to mark a section as "not relevant" if the predicted label is greygoo. Furthermore, we draw inspiration from the S-EM algorithm for PU learning 8 to create a threshold for inaccurate suggestions [39]. We sample spies (S) from the labeled training data (L) through a test-training split, so that |S| = 0.1 × |L|.…”