ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

XGBoost חצי-מפוקח×גרדיאנט בוסטינג×אלגוריתם התפשטות התוויות (Label Propagation)×XGBoost×
תחוםלמידת מכונהלמידת מכונהלמידת מכונהלמידת מכונה
משפחהMachine learningMachine learningMachine learningMachine learning
שנת המקור2016–2018200120022016
הוגה השיטהChen, T. & Guestrin, C. (XGBoost); semi-supervised extension by multiple authorsFriedman, J. H.Zhu, X. & Ghahramani, Z.Chen, T. & Guestrin, C.
סוגEnsemble (semi-supervised gradient boosting)Ensemble (sequential boosting of decision trees)Graph-based semi-supervised classificationEnsemble (gradient-boosted decision trees)
מקור מכונןChen, 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 ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
כינוייםSS-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 propagationXGBoost, extreme gradient boosting, scalable tree boosting
קשורות4535
תקצירSemi-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.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.
ScholarGateמערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 1 מקורות
  3. PUBLISHED
  1. v1
  2. 3 מקורות
  3. PUBLISHED
  1. v1
  2. 1 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Semi-supervised XGBoost · Gradient Boosting · Label Propagation · XGBoost. אוחזר בתאריך 2026-06-19 מתוך https://scholargate.app/he/compare