ScholarGate
دستیار

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

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

بگینگ (تجمیع بوت‌استرپ)×بوستینگ×درخت تصمیم×
حوزهیادگیری ماشینیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learningMachine learning
سال پیدایش19961990–19971984
پدیدآورBreiman, L.Schapire, R. E.; Freund, Y.Breiman, Friedman, Olshen & Stone
نوعEnsemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)Recursive partitioning (if-then rules)
منبع بنیادینBreiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗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 ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗
نام‌های دیگرBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree
مرتبط565
خلاصهBagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.
ScholarGateمجموعه‌داده
  1. v1
  2. 3 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 1 منابع
  3. PUBLISHED

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

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