Сравнение методов

	Полуавтоматическое бустирование (Semi-supervised Boosting)	AdaBoost	Градиентный бустинг	Распространение меток	Обучение с частичной разметкой
Область	Машинное обучение	Машинное обучение	Машинное обучение	Машинное обучение	Машинное обучение
Семейство	Machine learning	Machine learning	Machine learning	Machine learning	Machine learning
Год появления	1999–2009	1997	2001	2002	1970s–2006 (formalized)
Автор метода	Mallapragada, P. K.; Bennett, K. P.; and others	Freund, Y. & Schapire, R.E.	Friedman, J. H.	Zhu, X. & Ghahramani, Z.	Vapnik, V. N. and others (community of researchers, 1970s–2000s)
Тип	Semi-supervised ensemble method	Ensemble (sequential boosting of weak learners)	Ensemble (sequential boosting of decision trees)	Graph-based semi-supervised classification	Learning paradigm
Основополагающий источник	Mallapragada, P. K., Jin, R., Jain, A. K., & Liu, Y. (2009). SemiBoost: Boosting for Semi-supervised Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(11), 2000–2014.	Freund, Y. & Schapire, R.E. (1997). A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences, 55(1), 119–139.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.	Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University.	Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
Другие названия	SemiBoost, SSL boosting, boosting with unlabeled data, semi-supervised ensemble boosting	AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	LP, label spreading, graph-based semi-supervised learning, harmonic label propagation	SSL, semi-supervised machine learning, transductive learning, label-efficient learning
Связанные	5	5	5	3	5
Сводка	Semi-supervised Boosting is an ensemble learning paradigm that extends classical boosting algorithms — such as AdaBoost — to exploit both labeled and unlabeled data. By propagating label information through a similarity structure over unlabeled instances, it trains stronger classifiers than supervised boosting alone when labeled data are scarce.	AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.	Label Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data.	Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained.