Positive and unlabeled learning in categorical data
Résumé
In common binary classification scenarios, the presence of both positive and negative examples in training data
is needed to build an efficient classifier. Unfortunately, in many domains, this requirement is not satisfied and
only one class of examples is available. To cope with this setting, classification algorithms have been introduced
that learn from Positive and Unlabeled (PU) data. Originally, these approaches were exploited in the context of
document classification. Only few works address the PU problem for categorical datasets. Nevertheless, the
available algorithms are mainly based on Naive Bayes classifiers. In this work we present a new distance based
PU learning approach for categorical data: Pulce. Our framework takes advantage of the intrinsic relationships
between attribute values and exceeds the independence assumption made by Naive Bayes. Pulce, in fact,
leverages on the statistical properties of the data to learn a distance metric employed during the classification
task. We extensively validate our approach over real world datasets and demonstrate that our strategy obtains
statistically significant improvements w.r.t. state-of-the-art competitors.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...