Please use this identifier to cite or link to this item:
|Title:||Parallel sequential minimal optimization for the training of support vector machines||Authors:||Cao, L.J.
|Keywords:||Message passing interface (MPI)
Sequential minimal optimization (SMO)
Support vector machine (SVM)
|Issue Date:||Jul-2006||Citation:||Cao, L.J., Keerthi, S.S., Ong, C.-J., Zhang, J.Q., Periyathamby, U., Fu, X.J., Lee, H.P. (2006-07). Parallel sequential minimal optimization for the training of support vector machines. IEEE Transactions on Neural Networks 17 (4) : 1039-1049. ScholarBank@NUS Repository. https://doi.org/10.1109/TNN.2006.875989||Abstract:||Sequential minimal optimization (SMO) is one popular algorithm for training support vector machine (SVM), but it still requires a large amount of computation time for solving large size problems. This paper proposes one parallel implementation of SMO for training SVM. The parallel SMO is developed using message passing interface (MPI). Specifically, the parallel SMO first partitions the entire training data set into smaller subsets and then simultaneously runs multiple CPU processors to deal with each of the partitioned data sets. Experiments show that there is great speedup on the adult data set and the Mixing National Institute of Standard and Technology (MNIST) data set when many processors are used. There are also satisfactory results on the Web data set. © 2006 IEEE.||Source Title:||IEEE Transactions on Neural Networks||URI:||http://scholarbank.nus.edu.sg/handle/10635/61045||ISSN:||10459227||DOI:||10.1109/TNN.2006.875989|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 22, 2019
WEB OF SCIENCETM
checked on Aug 14, 2019
checked on Aug 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.