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/ar/compare