@article{(Open Science Index):https://publications.waset.org/pdf/5928, title = {On Speeding Up Support Vector Machines: Proximity Graphs Versus Random Sampling for Pre-Selection Condensation}, author = {Xiaohua Liu and Juan F. Beltran and Nishant Mohanchandra and Godfried T. Toussaint}, country = {}, institution = {}, abstract = {Support vector machines (SVMs) are considered to be the best machine learning algorithms for minimizing the predictive probability of misclassification. However, their drawback is that for large data sets the computation of the optimal decision boundary is a time consuming function of the size of the training set. Hence several methods have been proposed to speed up the SVM algorithm. Here three methods used to speed up the computation of the SVM classifiers are compared experimentally using a musical genre classification problem. The simplest method pre-selects a random sample of the data before the application of the SVM algorithm. Two additional methods use proximity graphs to pre-select data that are near the decision boundary. One uses k-Nearest Neighbor graphs and the other Relative Neighborhood Graphs to accomplish the task.}, journal = {International Journal of Computer and Information Engineering}, volume = {7}, number = {1}, year = {2013}, pages = {133 - 140}, ee = {https://publications.waset.org/pdf/5928}, url = {https://publications.waset.org/vol/73}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 73, 2013}, }