ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

AdaBoost×گرادیان بوستینگ (Gradient Boosting)×رأی اکثریت×
حوزهیادگیری ماشینیادگیری ماشینیادگیری گروهی
خانوادهMachine learningMachine learningMachine learning
سال پیدایش199720011996
پدیدآورFreund, Y. & Schapire, R.E.Friedman, J. H.Leo Breiman
نوعEnsemble (sequential boosting of weak learners)Ensemble (sequential boosting of decision trees)voting aggregation
منبع بنیادین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. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140. DOI ↗
نام‌های دیگرAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machinehard voting
مرتبط555
خلاصه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.Majority voting is an ensemble method that combines predictions from multiple base classifiers by selecting the class that receives the most votes. Each base classifier casts one vote for a predicted class, and the final prediction is the class with the majority (plurality). This approach was formalized by Leo Breiman and colleagues in the 1990s as a simple yet effective way to improve classification accuracy.
ScholarGateمجموعه‌داده
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: AdaBoost · Gradient Boosting · Majority Voting. بازیابی‌شده در 2026-06-17 از https://scholargate.app/fa/compare