.png){kind=icon}
.png){kind=icon}
Return
Discovering Voting Power for Ensemble Methods
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-02049-9_28.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Ensemble methods aggregate the predictions of multiple models by some form of weighted voting. In this work, we consider the impact of the choice of the assignment of voting power to every individual model on the performance of ensemble methods. We empirically and comparatively evaluate the accuracy and running time of the different power voting ensemble methods using standard classifiers and mainstream classification benchmarks. The results show that power ensemble voting outperforms the equal-power baseline, and that unsupervised learning of the voting power can be competitive with respect to supervised learning; within supervised approaches, learning voting power through Shapley values and regression outperforms simply using accuracy.
Keywords:
Ensemble Methods
Voting Power
Shapley Values
Inverse Entropy
Truth Discovery
Classification
Journal
D
IF:
0
Papers:
25
Citations:
0