방법 비교

	보르다 계수 집계 (Borda Count Aggregation)	다수결 투표	적층 일반화
분야	앙상블 학습	앙상블 학습	앙상블 학습
계열	Machine learning	Machine learning	Machine learning
기원 연도	1781	1996	1992
창시자	Jean-Charles de Borda	Leo Breiman	David Wolpert
유형	rank-based aggregation	voting aggregation	meta-learning aggregation
원전	Borda, J. C. de (1781). Mémoire sur les élections au scrutin. Histoire de l'Académie Royale des Sciences.	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140.	Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241-259.
별칭	weighted voting, rank aggregation	hard voting	stacking, meta-learning
관련	3	5	3
요약	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.	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.