DocumentCode
2543182
Title
Two-stage svm classification for large data sets via randomly reducing and recovering training data
Author
Li, XiaoOu ; Cervantes, Jair ; Yu, Wen
Author_Institution
Nat. Polytech. Inst. (CINVESTAV-IPN), Mexico City
fYear
2007
fDate
7-10 Oct. 2007
Firstpage
3633
Lastpage
3638
Abstract
Despite of good theoretic foundations and high classification accuracy of support vector machine (SVM), normal SVM is not suitable for classification of large data sets, because the training complexity of SVM is very high. This paper presents a novel two stages SVM classification approach for large data sets by randomly selecting training data. The first stage SVM classification gets a sketch of support vector distribution. Then the neighbors of these support vectors in original data set are used as training data for the second stage SVM classification. Experimental results demonstrate that our approach have good classification accuracy while the training is significantly faster than other SVM classifiers.
Keywords
data reduction; pattern classification; support vector machines; data reduction; large data sets classification; support vector distribution; support vector machine; training data recovery; Artificial neural networks; Bayesian methods; Cities and towns; Classification tree analysis; Decision trees; Nearest neighbor searches; Quadratic programming; Support vector machine classification; Support vector machines; Training data;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 2007. ISIC. IEEE International Conference on
Conference_Location
Montreal, Que.
Print_ISBN
978-1-4244-0990-7
Electronic_ISBN
978-1-4244-0991-4
Type
conf
DOI
10.1109/ICSMC.2007.4413814
Filename
4413814
Link To Document