The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
A bagging SVM to learn from positive and unlabeled examples
Open accessAbstract
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 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 new method for PU learning with a conceptually simple implementation based on bootstrap aggregating (bagging) techniques: the algorithm iteratively trains many binary classifiers to discriminate the known positive examples from random subsamples of the unlabeled set, and averages their predictions. We show theoretically and experimentally that the method can match and even outperform the performance of state-of-the-art methods for PU learning, particularly when the number of positive examples is limited and the fraction of negatives among the unlabeled examples is small. The proposed method can also run considerably faster than state-of-the-art methods, particularly when the set of unlabeled examples is large.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
John Lu, Z. Q. (2010) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2010.00646_6.x · Cited by 12,390
Libsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
Estimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 2×
“(Joachims, 1997) or using more advanced learning methods such as 1-class SVM (Schölkopf et al., 2001; Manevitz and Yousef, 2001; Vert and Vert, 2006; De Bie et al., 2007) Alternatively, the problem of inductive PU learning has been studied on its own from a theoretical viewpoint (Denis et al.,…”
Method(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Transductive Inference for Text Classification using Support Vector Machines
Joachims, T. (1999) · Cited by 2,723
A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization
Joachims, T. (1997) · Cited by 1,262
One-class svms for document classification
Manevitz, L. M., & Yousef, M. (2002) · doi:10.5555/944790.944808 · Cited by 1,207
Learning classifiers from only positive and unlabeled data
Elkan, C., & Noto, K. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401920 · Cited by 1,028
Gene prioritization through genomic data fusion
Aerts, S., Lambrechts, D., Maity, S., Van Loo, P., Coessens, B., De Smet, F., Tranchevent, L.-C., De Moor, B., Marynen, P., Hassan, B., et al. (2006) · Nature Biotechnology · doi:10.1038/nbt1203 · Cited by 890
Building text classifiers using positive and unlabeled examples
Liu, B., Dai, Y., Li, X., Lee, W. S., & Yu, P. S. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250918 · Cited by 667
Partially Supervised Classification of Text Documents
Liu, B., Lee, W. S., Yu, P. S., & Li, X. (2002) · Cited by 534
Learning to classify texts using positive and unlabeled data
Li, X., & Liu, B. (2003) · National University of Singapore · Cited by 421
Salgado, H. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkj156 · Cited by 368
Learning with Positive and Unlabeled Examples Using Weighted Logistic Regression
Lee, W. S., & Liu, B. (2003) · Cited by 339
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Lapata, M., & Barzilay, R. (2005) · Cited by 337
Faith, J. J., Driscoll, M. E., Fusaro, V. A., Cosgrove, E. J., Hayete, B., Juhn, F. S., Schneider, S. J., & Gardner, T. S. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm815 · Cited by 259
Pebl:web page classification without negative examples
Yu, H., Han, J., & Chang, K. C. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.1264823 · Cited by 257
Learning from positive and unlabeled examples
Denis, F., Gilleron, R., & Letouzey, F. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.007 · Cited by 217
SIRENE: supervised inference of regulatory networks
Mordelet, F., & Vert, J.-P. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn273 · Cited by 191
Self-citationA Neyman–Pearson Approach to Statistical Learning
Scott, C. D., & Nowak, R. D. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.856955 · Cited by 159
Kernel-based data fusion for gene prioritization
Bie, T. D., Tranchevent, L.-C., van Oeffelen, L. M. M., & Moreau, Y. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm187 · Cited by 142
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
Vert, R., & Vert, J. (2006) · doi:10.5555/1248547.1248576 · Cited by 140
Self-citationMaximum Margin Clustering Made Practical
Zhang, K., Tsang, I. W.-H., & Kwok, J. T.-Y. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2010620 · Cited by 130
Novelty detection: Unlabeled data definitely help
Scott, C. D., & Blanchard, G. (2009) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 77
Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results
Bartlett, P. L., & Tewari, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27819-1_39 · Cited by 70
Shah, A. R., OEHMEN, C. S., & Webb‐Robertson, B. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn028 · Cited by 55
Sparseness vs estimating conditional probabilities: Some asymptotic results
Bartlett, P. L., Tewari, A., & Lugosi, G. (2007) · QUT ePrints (Queensland University of Technology) · Cited by 18
Transductively Learning from Positive Examples Only
Kristiaan Pelckmans, A., & Suykens, J. A. K. (2009) · Cited by 9
Learning from positive and unlabeled examples by enforcing statistical significance
Geurts, P. (2011) · ORBi (University of Liège) · Cited by 8
Learning from positive and unlabeled examples by enforcing statistical signicance
Geurts, P. (2011) · Proceedings of Machine Learning Research · Cited by 6
Cited by
Learning from positive and unlabeled data: a survey
Bekker, J., & Davis, J. (2020) · Machine Learning · doi:10.1007/s10994-020-05877-5 · Cited by 651
“Several PU methods were developed to this end: ProDiGe is a method based on bagging SVMs [70,72], PUDI is also a weighted SVM method, but they have different weights for four identified groups of unlabeled examples: reliable negative, likely positive, likely negative and weakly negative [110],”
BackgroundMethodInfluentialYao, Y., Li, X., Liu, X., Liu, P., Liang, Z., Zhang, J., & Mai, K. (2017) · International Journal of Geographical Information Science · doi:10.1080/13658816.2016.1244608 · Cited by 488
Frey, N. C., Wang, J., Vega Bellido, G. I., Anasori, B., Gogotsi, Y., & Shenoy, V. B. (2019) · ACS Nano · doi:10.1021/acsnano.8b08014 · Cited by 346
Prediction and Validation of Disease Genes Using HeteSim Scores
Zeng, X., Liao, Y., Liu, Y., & Zou, Q. (2017) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2016.2520947 · Cited by 208
DiscoTope-3.0: improved B-cell epitope prediction using inverse folding latent representations
Høie, M. H., Gade, F. S., Johansen, J. M., Würtzen, C., Winther, O., Nielsen, M., & Marcatili, P. (2024) · Frontiers in Immunology · doi:10.3389/fimmu.2024.1322712 · Cited by 151
Metadata
- Authors
- Mordelet, F., & Vert, J.-P.
- Venue
- Pattern Recognition Letters
- Publisher
- Elsevier BV
- Published
- 2014-02
- Volume
- 37
- Pages
- 201-209
- ISSN
- 0167-8655 (ISSN-L)
- OpenAlex
- W2050871273
- Cited by
- 335
- References
- 34
- FWCI
- 11.04
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.