Title :
The Research on an Improved Fast SVM Classification Algorithm
Author :
Xingli, Bai ; Yuanping, Zhang
Author_Institution :
Coll. of Comput. Software, Henan Inst. of Eng., Zhengzhou, China
Abstract :
The fast SVM classification algorithm - FCSVM adopt the way to transform of support vector sets, substituting a subset of all the support vector classification for support vector machines, it makes the classification speed improve a lot compared with traditional SVM algorithm under the premise of not losing. In order to obtain the minimum subset of support vector, and to avoid the movement of support vector, the FCSV M algorithm has been improved. It optimizes the support vector in the classification function by using of dichotomy, and provides the necessary and sufficient conditions for the existence of transformation matrix and construction method to reduce the amount of computation. The result of experiments shows that the improved fast classification algorithms considerably reduces the computational complexity and improves the speed of classification, particularly in the circumstances of the large-scale training set and a large number of support vector, its effects become more obvious.
Keywords :
computational complexity; matrix algebra; set theory; support vector machines; computational complexity; improved fast SVM classification algorithm; minimum support vector subset; support vector classification; support vector machines; transformation matrix; Classification algorithms; Computational complexity; Educational institutions; Electronic mail; Optimization methods; Pattern recognition; Software algorithms; Sufficient conditions; Support vector machine classification; Support vector machines; FCSVM classification; fast algorithm; improvement svm; support vector machine;
Conference_Titel :
Computational Intelligence and Design, 2009. ISCID '09. Second International Symposium on
Conference_Location :
Changsha
Print_ISBN :
978-0-7695-3865-5
DOI :
10.1109/ISCID.2009.221