방법 비교

	보르다 계수 집계 (Borda Count Aggregation)	다수결 투표	가중 투표
분야	앙상블 학습	앙상블 학습	의사결정
계열	Machine learning	Machine learning	MCDM
기원 연도	1781	1996	1951
창시자	Jean-Charles de Borda	Leo Breiman	Arrow, K. J.
유형	rank-based aggregation	voting aggregation	Social choice — weighted positional voting rule
원전	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.	Arrow, K. J. (1951). Social Choice and Individual Values. Wiley, New York
별칭	weighted voting, rank aggregation	hard voting	—
관련	3	5	0
요약	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.	WEIGHTED-VOTING (Weighted Voting — Weighted positional aggregation of multiple rankings) is a ranking multi-criteria decision-making (MCDM) method introduced by Arrow, K. J. in 1951. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result.