ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Agregarea prin metoda Borda×Generalizare stratificată (Stacked Generalization)×
DomeniuÎnvățare prin ansambluriÎnvățare prin ansambluri
FamilieMachine learningMachine learning
Anul apariției17811992
Autorul originalJean-Charles de BordaDavid Wolpert
Tiprank-based aggregationmeta-learning aggregation
Sursa seminală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 ↗
Denumiri alternativeweighted voting, rank aggregationstacking, meta-learning
Înrudite33
RezumatBorda 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.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Borda Count Aggregation · Stacked Generalization. Preluat la 2026-06-17 de pe https://scholargate.app/ro/compare