Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A bagging SVM to learn from positive and unlabeled examples

Abstract : We consider the problem of learning a binary classifier from a training set of positive and unlabeled examples, both in the inductive and in the transductive setting. This problem, often referred to as \emph{PU learning}, differs from the standard supervised classification problem by the lack of negative examples in the training set. It corresponds to an ubiquitous situation in many applications such as information retrieval or gene ranking, when we have identified a set of data of interest sharing a particular property, and we wish to automatically retrieve additional data sharing the same property among a large and easily available pool of unlabeled data. We propose a conceptually simple method, akin to bagging, to approach both inductive and transductive PU learning problems, by converting them into series of supervised binary classification problems discriminating the known positive examples from random subsamples of the unlabeled set. We empirically demonstrate the relevance of the method on simulated and real data, where it performs at least as well as existing methods while being faster.
Keywords : PU learning Bagging SVM
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00523336
Contributor : Fantine Mordelet <>
Submitted on : Monday, October 4, 2010 - 7:10:33 PM
Last modification on : Thursday, April 9, 2020 - 5:08:16 PM
Document(s) archivé(s) le : Wednesday, January 5, 2011 - 3:13:19 AM

Files

PUL-techreport.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00523336, version 1
  • ARXIV : 1010.0772

Citation

Fantine Mordelet, Jean-Philippe Vert. A bagging SVM to learn from positive and unlabeled examples. 2010. ⟨hal-00523336⟩

Share

Metrics

Record views

1155

Files downloads

738