Fast Pattern Selection for Support Vector ClassifiersOpen Website

Published: 2003, Last Modified: 12 May 2023PAKDD 2003Readers: Everyone
Abstract: Training SVM requires large memory and long cpu time when the pattern set is large. To alleviate the computational burden in SVM training, we propose a fast preprocessing algorithm which selects only the patterns near the decision boundary. Preliminary simulation results were promising: Up to two orders of magnitude, training time reduction was achieved including the preprocessing, without any loss in classification accuracies.
0 Replies

Loading