The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Learning classifiers from only positive and unlabeled data
Abstract
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and the other set consists of negative examples. However, it is often the case that the available training data are an incomplete set of positive examples, and a set of unlabeled examples, some of which are positive and some of which are negative. The problem solved in this paper is how to learn a standard binary classifier given a nontraditional training set of this nature.
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
Statistical Analysis With Missing Data
Lahiff, M., Little, R. J. A., & Rubin, D. B. (1989) · Journal of the American Statistical Association · doi:10.2307/2289883 · Cited by 17,265
Statistical Analysis with Missing Data
Little, R. J. A., & Rubin, D. B. (2002) · Wiley Series in Probability and Statistics · doi:10.1002/9781119013563 · Cited by 8,473
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 1×
“The second approach is to use a so-called one-class SVM [16, 19].”
MethodThe SWISS-PROT protein knowledgebase and its supplement TrEMBL in 2003
Boeckmann, B. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg095 · Cited by 3,890
Support Vector Data Description
Tax, D. M. J., & Duin, R. P. W. (2004) · Machine Learning · doi:10.1023/b:mach.0000008084.60811.49 · Cited by 3,512
Transforming classifier scores into accurate multiclass probability estimates
Zadrozny, B., & Elkan, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775151 · Cited by 1,280
Self-citationOne-class svms for document classification
Manevitz, L. M., & Yousef, M. (2002) · doi:10.5555/944790.944808 · Cited by 1,207
Platt, J. C. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0008 · Cited by 1,156
A note on Platt’s probabilistic outputs for support vector machines
Lin, H.-T., Lin, C.-J., & Weng, R. C. (2007) · Machine Learning · doi:10.1007/s10994-007-5018-6 · Cited by 867
Saier, M. H. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkj001 · Cited by 858
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
Autonomously semantifying wikipedia
Wu, F., & Weld, D. S. (2007) · Proceedings of the sixteenth ACM conference on Conference on information and knowledge management · doi:10.1145/1321440.1321449 · Cited by 375
Learning with Positive and Unlabeled Examples Using Weighted Logistic Regression
Lee, W. S., & Liu, B. (2003) · Cited by 339
Presence‐Only Data and the EM Algorithm
Ward, G., Hastie, T., Barry, S., Elith, J., & Leathwick, J. R. (2009) · Biometrics · doi:10.1111/j.1541-0420.2008.01116.x · Cited by 295
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
The Molecular Biology Database Collection: 2005 update
Galperin, M. Y. (2004) · Nucleic Acids Research · doi:10.1093/nar/gki139 · Cited by 229
Text classification without negative examples revisit
Fung, G. P. C., Yu, J. X., Lu, H., & Yu, P. S. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.16 · Cited by 221
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
Proceedings of the Twentieth International Conference on Machine Learning (ICML-2003)
Hwa, R., Osborne, M., Sarkar, A., & Steedman, M. J. (2003) · Cited by 201
PAC Learning from Positive Statistical Queries
Denis, F. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49730-7_9 · Cited by 176
The Molecular Biology Database Collection: 2008 update
Galperin, M. Y. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm1037 · Cited by 134
PSoL: a positive sample only learning algorithm for finding non-coding RNA genes
Wang, C., Ding, C. H. Q., Meraz, R. F., & Holbrook, S. R. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl441 · Cited by 102
Single-Class Classification with Mapping Convergence
Yu, H. (2005) · Machine Learning · doi:10.1007/s10994-005-1122-7 · Cited by 68
Making generative classifiers robust to selection bias
Smith, A. T., & Elkan, C. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281263 · Cited by 29
Self-citationA Bayesian network framework for reject inference
Smith, A., & Elkan, C. (2004) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1014052.1014085 · Cited by 28
Self-citationPartially Supervised Classification – Based on Weighted Unlabeled Samples Support Vector Machine
Liu, Z., Shi, W., Li, D., & Qin, Q. (2005) · Lecture notes in computer science · doi:10.1007/11527503_15 · Cited by 23
Cited by
A survey on semi-supervised learning
van Engelen, J. E., & Hoos, H. H. (2020) · Machine Learning · doi:10.1007/s10994-019-05855-6 · Cited by 2,666
The Transporter Classification Database (TCDB): recent advances
Saier, M. H., Reddy, V. S., Tsu, B. V., Ahmed, M. S., Li, C., & Moreno-Hagelsieb, G. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkv1103 · Cited by 999
Confident Learning: Estimating Uncertainty in Dataset Labels
Northcutt, C., Jiang, L., & Chuang, I. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12125 · Cited by 795
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
“The non-traditional classifier (Elkan and Noto 2008; Northcutt et al. 2017) and some partial matching (Du Plessis and Sugiyama 2014) approaches make the assumption that the positive and negative example are separable.”
BackgroundMethodInfluentialOne-class classification: taxonomy of study and review of techniques
Khan, S. S., & Madden, M. G. (2014) · The Knowledge Engineering Review · doi:10.1017/s026988891300043x · Cited by 600
Metadata
- Authors
- Elkan, C., & Noto, K.
- Venue
- Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2008-08-24
- Pages
- 213-220
- OpenAlex
- W2123958887
- Cited by
- 1,028
- References
- 26
- FWCI
- 14.64
- Type
- conference paper
- Language
- en
- Open access
- closed
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.