The DOI matches its Crossref record; 211 of the 211 references it cites were found in a registry or an index.
A survey on semi-supervised learning
Open accessAbstract
Abstract Semi-supervised learning is the branch of machine learning concerned with using labelled as well as unlabelled data to perform certain learning tasks. Conceptually situated between supervised and unsupervised learning, it permits harnessing the large amounts of unlabelled data available in many use cases in combination with typically smaller sets of labelled data. In recent years, research in this area has followed the general trends observed in machine learning, with much attention directed at neural network-based models and generative learning. The literature on the topic has also expanded in volume and scope, now encompassing a broad spectrum of theory, algorithms and applications. However, no recent surveys exist to collect and organize this knowledge, impeding the ability of researchers and engineers alike to utilize it. Filling this void, we present an up-to-date overview of semi-supervised learning methods, covering earlier work as well as more recent advances. We focus primarily on semi-supervised classification, where the large majority of semi-supervised learning research takes place. Our survey aims to provide researchers and practitioners new to the field as well as more advanced readers with a solid understanding of the main approaches and algorithms developed over the past two decades, with an emphasis on the most prominent and currently relevant work. Furthermore, we propose a new taxonomy of semi-supervised classification algorithms, which sheds light on the different conceptual and methodological approaches for incorporating unlabelled data into the training process. Lastly, we show how the fundamental assumptions underlying most semi-supervised learning algorithms are closely connected to each other, and how they relate to the well-known semi-supervised clustering assumption.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Semi-supervised learning uses both labelled and unlabeled data to perform specific tasks [9].”
From Self-supervised learning: A succinct review (2023) · cites this paper as [9]
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
Items 201–211 of 211
Learning a Manifold as an Atlas
Pitelis, N., Russell, C., & Agapito, L. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.215 · Cited by 34
Towards semi-supervised classification with Markov random fields
Zhu, X., Ghahramani, Z., & Lafferty, J. (2002) · Cambridge University Engineering Department Publications Database · Cited by 33
Random Forest Construction With Robust Semisupervised Node Splitting
Liu, X., Song, M., Tao, D., Liu, Z., Zhang, L., Chen, C., & Bu, J. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2378017 · Cited by 31
Semi-Supervised Learning -- A Statistical Physics ApproachPreprint
Getz, G. A., Shental, N., & Domany, E. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0604011 · Cited by 29
Semi-supervised Learning Using an Unsupervised Atlas
Pitelis, N., Russell, C., & Agapito, L. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44851-9_36 · Cited by 28
Semi-supervised learning with max-margin graph cutsPreprint
Kveton, B., Valko, M., Rahimi, A., et al. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.26818 · Cited by 28
Recurrent Ladder NetworksPreprint
Prémont-Schwarz, I., Ilin, A., Hao, T., Rasmus, A., Boney, R., & Harri Valpola, B. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.09219 · Cited by 22
Boosting Mixture Models for Semi-supervised Learning
Grandvalet, Y., d’Alché–Buc, F., & Ambroise, C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44668-0_7 · Cited by 17
An AdaBoost Algorithm for Multiclass Semi-supervised Learning
Tanha, J., van Someren, M., & Afsarmanesh, H. (2012) · Proceedings · doi:10.1109/icdm.2012.119 · Cited by 12
Learning Low-Density SeparatorsPreprint
Ben-David, S., Lu, T., Pál, D., et al. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0805.2891 · Cited by 11
TSFS: A Novel Algorithm for Single View Co-training
Zhang, W., & Zheng, Q. (2009) · International Joint Conference on Computational Sciences and Optimization (CSO) · doi:10.1109/cso.2009.251 · Cited by 10
Flagged first, then by citations
Research works printed but not linked: 10
- Abney, S. (2002). Bootstrapping. In Proceedings of the 40th annual meeting on association for computational linguistics, association for computational linguistics (pp. 360–367).
- Corduneanu, A., & Jaakkola, T. (2003). On information regularization. In Proceedings of the 19th conference on uncertainty in artificial intelligence (pp. 151–158). Morgan Kaufmann Publishers Inc.
- Demiriz, A., Bennett, K. P., & Embrechts, M. J. (1999). Semi-supervised clustering using genetic algorithms. In Artificial Neural Networks in Engineering (pp. 809–814).
- Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., & Bengio, Y. (2014a). Generative adversarial nets. In Advances in neural information processing systems (pp. 2672–2680).
- Grira, N., Crucianu, M., & Boujemaa, N. (2004). Unsupervised and semisupervised clustering: A brief survey. In 7th ACM SIGMM international workshop on multimedia information retrieval.
- Laine, S., & Aila, T. (2017). Temporal ensembling for semi-supervised learning. In International conference on learning, representations.
- Lee, D. H. (2013). Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks. In Proceedings of the 30th ICML workshop on challenges in representation learning (Vol. 3, p. 2).
- Rasmus, A., Berglund, M., Honkala, M., Valpola, H., & Raiko, T. (2015). Semi-supervised learning with ladder networks. In Advances in neural information processing systems (pp. 3546–3554).
- Wager, S., Wang, S., & Liang, P. S. (2013). Dropout training as adaptive regularization. In Advances in neural information processing systems (pp. 351–359).
- Yang, Z., Cohen, W. W., & Salakhutdinov, R. (2016) Revisiting semi-supervised learning with graph embeddings. In Proceedings of the 33rd international conference on machine learning (pp. 40–48).
Cited by
Sorted by citations
Zhang, J., & Tao, D. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3039359 · Cited by 774
Federated learning for medical image analysis: A survey
Guan, H., Yap, P.-T., Bozoki, A., & Liu, M. (2024) · Pattern Recognition · doi:10.1016/j.patcog.2024.110424 · Cited by 518
Learning the protein language: Evolution, structure, and function
Bepler, T., & Berger, B. (2021) · Cell Systems · doi:10.1016/j.cels.2021.05.017 · Cited by 483
Natural language processing applied to mental illness detection: a narrative review
Zhang, T., Schoene, A. M., Ji, S., & Ananiadou, S. (2022) · npj Digital Medicine · doi:10.1038/s41746-022-00589-7 · Cited by 476
Efficient Acceleration of Deep Learning Inference on Resource-Constrained Edge Devices: A Review
Shuvo, M. M. H., Islam, S. K., Cheng, J., & Morshed, B. I. (2023) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3226481 · Cited by 436
“Semisupervised techniques include expectation maximization with generative mixture models, transductive SVMs, graph-based methods, and so on [39], [40].”
BackgroundMethod
Metadata
- Authors
- van Engelen, J. E., & Hoos, H. H.
- Affiliations
- Leiden University (NL)
- Venue
- Machine Learning
- Published
- 2019-11-15
- Volume
- 109
- Issue
- 2
- Pages
- 373-440
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2984353870
- Cited by
- 2,666
- References
- 211
- Citations by year
- 2026: 292 · 2025: 501 · 2024: 467 · 2023: 558 · 2022: 464 · 2021: 313 · 2020: 68 · 2019: 3
- FWCI
- 96.74
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- Machine Learning (publishedVersion, cc-by)
- Funders
- Leiden University
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Keywords
- semi-supervised learning, semi-supervised classification, unlabeled data, generative models
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
