ScholarGate
دستیار

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

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

تجمیع شمارش بوردا×تعمیم پشته‌ای×
حوزهیادگیری گروهییادگیری گروهی
خانوادهMachine learningMachine learning
سال پیدایش17811992
پدیدآورJean-Charles de BordaDavid Wolpert
نوعrank-based aggregationmeta-learning aggregation
منبع بنیادینBorda, J. C. de (1781). Mémoire sur les élections au scrutin. Histoire de l'Académie Royale des Sciences. link ↗Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241-259. DOI ↗
نام‌های دیگرweighted voting, rank aggregationstacking, meta-learning
مرتبط33
خلاصهBorda count is a preference aggregation method that combines ranked predictions from multiple classifiers by assigning points based on ranking position. Each classifier ranks the possible outcomes, and each class receives points inversely proportional to its rank position. The class with the highest total score is selected. Originally proposed by French mathematician Jean-Charles de Borda in 1781, this method has been adapted for ensemble learning to aggregate soft predictions and rank-ordered outputs.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مقایسهٔ روش‌ها: Borda Count Aggregation · Stacked Generalization. بازیابی‌شده در 2026-06-17 از https://scholargate.app/fa/compare