How to effectively combine the outputs of base classifiers is one of the key issues in ensemble learning. A new dynamic ensemble selection algorithm is proposed in this paper. In order to predict a sample, the base classifiers whose classification confidences on this sample are greater than or equal to specified threshold value are selected. Since margin is an important factor to the generalization performance of voting classifiers, thus the threshold value is estimated via the minimization of margin loss. We analyze the proposed algorithm in detail and compare it with some other multiple classifiers fusion algorithms. The experimental results validate the effectiveness of our algorithm. © 2013 Springer-Verlag.
CITATION STYLE
Li, L., Hu, Q., Wu, X., & Yu, D. (2013). Exploring margin for dynamic ensemble selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8171 LNAI, pp. 178–187). https://doi.org/10.1007/978-3-642-41299-8_17
Mendeley helps you to discover research relevant for your work.