방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 보르다 계수 집계 (Borda Count Aggregation)× | 가중 투표× | |
|---|---|---|
| 분야≠ | 앙상블 학습 | 의사결정 |
| 계열≠ | Machine learning | MCDM |
| 기원 연도≠ | 1781 | 1951 |
| 창시자≠ | Jean-Charles de Borda | Arrow, K. J. |
| 유형≠ | rank-based 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. link ↗ | Arrow, K. J. (1951). Social Choice and Individual Values. Wiley, New York DOI ↗ |
| 별칭≠ | weighted voting, rank aggregation | — |
| 관련≠ | 3 | 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|