TY - GEN
T1 - An alternating genetic algorithm for selecting SVM model and training set
AU - Kawulok, Michal
AU - Nalepa, Jakub
AU - Dudzik, Wojciech
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - Support vector machines (SVMs) have been found highly helpful in solving numerous pattern recognition tasks. Although it is challenging to train SVMs from large data sets, this obstacle may be mitigated by selecting a small, yet representative, subset of the entire training set. Another crucial and deeply-investigated problem consists in selecting the SVM model. There have been a plethora of methods proposed to effectively deal with these two problems treated independently, however to the best of our knowledge, it was not explored how to effectively combine these two processes. It is a noteworthy observation that depending on the subset selected for training, a different SVM model may be optimal, hence performing these two operations simultaneously is potentially beneficial. In this paper, we propose a new method to select both the training set and the SVM model, using a genetic algorithm which alternately optimizes two different populations. We demonstrate that our approach is competitive with sequential optimization of the hyperparameters followed by selecting the training set. We report the results obtained for several benchmark data sets and we visualize the results elaborated for artificial sets of 2D points.
AB - Support vector machines (SVMs) have been found highly helpful in solving numerous pattern recognition tasks. Although it is challenging to train SVMs from large data sets, this obstacle may be mitigated by selecting a small, yet representative, subset of the entire training set. Another crucial and deeply-investigated problem consists in selecting the SVM model. There have been a plethora of methods proposed to effectively deal with these two problems treated independently, however to the best of our knowledge, it was not explored how to effectively combine these two processes. It is a noteworthy observation that depending on the subset selected for training, a different SVM model may be optimal, hence performing these two operations simultaneously is potentially beneficial. In this paper, we propose a new method to select both the training set and the SVM model, using a genetic algorithm which alternately optimizes two different populations. We demonstrate that our approach is competitive with sequential optimization of the hyperparameters followed by selecting the training set. We report the results obtained for several benchmark data sets and we visualize the results elaborated for artificial sets of 2D points.
KW - Model selection
KW - Selection Genetic algorithms
KW - Support vector machines
KW - Training set
UR - https://www.scopus.com/pages/publications/85021253924
U2 - 10.1007/978-3-319-59226-8_10
DO - 10.1007/978-3-319-59226-8_10
M3 - Conference contribution
AN - SCOPUS:85021253924
SN - 9783319592251
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 94
EP - 104
BT - Pattern Recognition - 9th Mexican Conference, MCPR 2017, Proceedings
A2 - Carrasco-Ochoa, Jesus Ariel
A2 - Martinez-Trinidad, Jose Francisco
A2 - Olvera-Lopez, Jose Arturo
PB - Springer Verlag
T2 - 9th Mexican Conference on Pattern Recognition, MCPR 2017
Y2 - 21 June 2017 through 24 June 2017
ER -