mlsanityData to 7 Oct 2026

A Robust Ensemble Approach to Learn From Positive and Unlabeled Data Using SVM Base Models

arXiv 1402.3144 ↗First posted 13 Feb 2014stat.ML cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

We present a novel approach to learn binary classifiers when only positive and unlabeled instances are available (PU learning). This problem is routinely cast as a supervised task with label noise in the negative set. We use an ensemble of SVM models trained on bootstrap resamples of the training data for increased robustness against label noise. The approach can be considered in a bagging framework which provides an intuitive explanation for its mechanics in a semi-supervised setting. We compared our method to state-of-the-art approaches in simulations using multiple public benchmark data sets. The included benchmark comprises three settings with increasing label noise: (i) fully supervised, (ii) PU learning and (iii) PU learning with false positives. Our approach shows a marginal improvement over existing methods in the second setting and a significant improvement in the third.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Feb 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 3; 2023: 0; 2024: 1; 2025: 1; 2026: 1.

7 papers.