.png){kind=icon}
Return
Optimal resampling and classifier prototype selection in classifier ensembles using genetic algorithms
.png){kind=icon}
PRE
AI
DOI：10.1007/BF02683994.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Ensembles of classifiers that are trained on different parts of the input space provide good results in general. As a popular boosting technique, AdaBoost is an iterative and gradient based deterministic method used for this purpose where an exponential loss function is minimized. Bagging is a random search based ensemble creation technique where the training set of each classifier is arbitrarily selected. In this paper, a genetic algorithm based ensemble creation approach is proposed where both resampled training sets and classifier prototypes evolve so as to maximize the combined accuracy. The objective function based random search procedure of the resultant system guided by both ensemble accuracy and diversity can be considered to share the basic properties of bagging and boosting. Experimental results have shown that the proposed approach provides better combined accuracies using a fewer number of classifiers than AdaBoost.
Keywords:
classifier ensembles
optimal resampling
multiple prototype ensembles
diversity
boosting
bagging
genetic algorithms
Journal
IF:
2
Papers:
1.9K
Citations:
1.9K
Organization
No organization information available
Cited Papers
Glycosylation of simian virus 40 T antigen and localization of glycosylated T antigen in in the nuclear matrix.png)
Virology
VirologyIF0
PREAI
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSaveShareSaveShareSave
View more