ScholarGate
Assistent

Compara mètodes

Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.

XGBoost semisupervisat×Gradient Boosting×Propagació d'etiquetes×Random Forest×XGBoost×
CampAprenentatge automàticAprenentatge automàticAprenentatge automàticAprenentatge automàticAprenentatge automàtic
FamíliaMachine learningMachine learningMachine learningMachine learningMachine learning
Any d'origen2016–20182001200220012016
Autor originalChen, T. & Guestrin, C. (XGBoost); semi-supervised extension by multiple authorsFriedman, J. H.Zhu, X. & Ghahramani, Z.Breiman, L.Chen, T. & Guestrin, C.
TipusEnsemble (semi-supervised gradient boosting)Ensemble (sequential boosting of decision trees)Graph-based semi-supervised classificationEnsemble (bagging of decision trees)Ensemble (gradient-boosted decision trees)
Font seminalChen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
ÀliesSS-XGBoost, semi-supervised gradient boosting, pseudo-label XGBoost, label-propagation XGBoostGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLP, label spreading, graph-based semi-supervised learning, harmonic label propagationRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensembleXGBoost, extreme gradient boosting, scalable tree boosting
Relacionats45345
ResumSemi-supervised XGBoost extends the XGBoost gradient boosting framework to settings where only a fraction of training examples carry labels. By iteratively generating pseudo-labels for unlabeled data and retraining on the expanded set, the method extracts signal from unlabeled observations, improving generalization when labeled data are scarce.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.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.
ScholarGateConjunt de dades
  1. v1
  2. 2 Fonts
  3. PUBLISHED
  1. v1
  2. 1 Fonts
  3. PUBLISHED
  1. v1
  2. 3 Fonts
  3. PUBLISHED
  1. v1
  2. 2 Fonts
  3. PUBLISHED
  1. v1
  2. 1 Fonts
  3. PUBLISHED

Ves a la cerca Baixa les diapositives

ScholarGateCompara mètodes: Semi-supervised XGBoost · Gradient Boosting · Label Propagation · Random Forest · XGBoost. Recuperat el 2026-06-18 de https://scholargate.app/ca/compare