방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 다수결 투표× | 가중 투표× | |
|---|---|---|
| 분야≠ | 앙상블 학습 | 의사결정 |
| 계열≠ | Machine learning | MCDM |
| 기원 연도≠ | 1996 | 1951 |
| 창시자≠ | Leo Breiman | Arrow, K. J. |
| 유형≠ | voting aggregation | Social choice — weighted positional voting rule |
| 원전≠ | Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140. DOI ↗ | Arrow, K. J. (1951). Social Choice and Individual Values. Wiley, New York DOI ↗ |
| 별칭≠ | hard voting | — |
| 관련≠ | 5 | 0 |
| 요약≠ | 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. |
| ScholarGate데이터셋 ↗ |
|
|