ScholarGate
دستیار

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

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

بوستینگ×بگینگ (تجمیع بوت‌استرپ)×درخت تصمیم×
حوزهیادگیری ماشینیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learningMachine learning
سال پیدایش1990–199719961984
پدیدآورSchapire, R. E.; Freund, Y.Breiman, L.Breiman, Friedman, Olshen & Stone
نوعSequential ensemble (iterative reweighting)Ensemble meta-algorithm (variance reduction via bootstrap aggregation)Recursive partitioning (if-then rules)
منبع بنیادین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. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗
نام‌های دیگرAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree
مرتبط655
خلاصه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.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.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. 2 منابع
  3. PUBLISHED
  1. v1
  2. 3 منابع
  3. PUBLISHED
  1. v1
  2. 1 منابع
  3. PUBLISHED

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

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