ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

XGBoost شبه المُشرف عليه×الغابات العشوائية×XGBoost×
المجالتعلم الآلةتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learningMachine learning
سنة النشأة2016–201820012016
صاحب الطريقةChen, T. & Guestrin, C. (XGBoost); semi-supervised extension by multiple authorsBreiman, L.Chen, T. & Guestrin, C.
النوعEnsemble (semi-supervised gradient boosting)Ensemble (bagging of decision trees)Ensemble (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 ↗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 ↗
الأسماء البديلةSS-XGBoost, semi-supervised gradient boosting, pseudo-label XGBoost, label-propagation XGBoostRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensembleXGBoost, extreme gradient boosting, scalable tree boosting
ذات صلة445
الملخص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.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.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 1 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Semi-supervised XGBoost · Random Forest · XGBoost. استُرجع بتاريخ 2026-06-19 من https://scholargate.app/ar/compare