ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

Borda计数聚合×堆叠泛化×
领域集成学习集成学习
方法族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/zh/compare