Name
Abstract | ||
|---|---|---|
Reduced set method is an important approach to speed zip support vector machine (SVM) training on large data sets. Existing works mainly focused on selecting patterns near the decision boundary for SVM training by applying clustering, nearest neighbor algorithm and so on. However, on very large data sets, these algorithms require huge computational overhead, and thus the total running time is still enormous. In this paper, an intuitive geometric method is developed to select convex hull samples in the feature space for SVM training, which has a time complexity that is linear with training set size n. Experiments on real data sets show that the proposed method not only preserves the generalization performance of the result SVM classifiers, but outperforms existing scale-up methods in terms of training time and number of support vectors. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ISKE.2008.4731074 | 2008 3RD INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEM AND KNOWLEDGE ENGINEERING, VOLS 1 AND 2 |
Keywords | DocType | Volume |
support vector machines,feature space,geometry,approximation algorithms,computational overhead,time complexity,nearest neighbor,accuracy,convex hull,kernel,support vector,support vector machine,classification algorithms,nearest neighbor algorithm,svm,computational complexity | Conference | null |
Issue | ISSN | Citations |
null | null | 7 |
PageRank | References | Authors |
0.50 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhiqiang Zeng | 1 | 139 | 16.35 |
| Huarong Xu | 2 | 7 | 0.50 |
| Yanqi Q. Xie | 3 | 7 | 0.50 |
| Ji Gao | 4 | 7 | 0.50 |