ScholarGate
دستیار

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

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

رأی اکثریت×تعمیم پشته‌ای×
حوزهیادگیری گروهییادگیری گروهی
خانوادهMachine learningMachine learning
سال پیدایش19961992
پدیدآورLeo BreimanDavid Wolpert
نوعvoting aggregationmeta-learning aggregation
منبع بنیادینBreiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140. DOI ↗Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241-259. DOI ↗
نام‌های دیگرhard votingstacking, meta-learning
مرتبط53
خلاصه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.Stacked generalization, or stacking, is a two-level ensemble method where base-level classifiers are trained on the original data, and a meta-learner is trained on the predictions of the base classifiers. The meta-learner learns how to best combine base predictions rather than using fixed aggregation rules. Introduced by David Wolpert in 1992, stacking achieves state-of-the-art performance by automatically learning the optimal weighting and interaction patterns among base models.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

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

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