Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
A Tutorial on Support Vector Machines for Pattern Recognition
Data Mining and Knowledge Discovery
Less is More: Active Learning with Support Vector Machines
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Classifying large data sets using SVMs with hierarchical clusters
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast SVM Training Algorithm with Decomposition on Very Large Data Sets
IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple Clipping Algorithms for Reduced Convex Hull SVM Training
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
Fast SVM Incremental Learning Based on the Convex Hulls Algorithm
CIS '08 Proceedings of the 2008 International Conference on Computational Intelligence and Security - Volume 01
Improved use of continuous attributes in C4.5
Journal of Artificial Intelligence Research
A Geometric Nearest Point Algorithm for the Efficient Solution of the SVM Classification Task
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
In this paper we present a new algorithm to speed up the training time of Support Vector Machines (SVM). SVM has some important properties like solid mathematical background and a better generalization capability than other machines like for example neural networks. On the other hand, the major drawback of SVM occurs in its training phase, which is computationally expensive and highly dependent on the size of input data set. The proposed algorithm uses a data filter to reduce the input data set to train a SVM. The data filter is based on an induction tree which effectively reduces the training data set for SVM, producing a very fast and high accuracy algorithm. According to the results, the algorithm produces results in a faster way than existing SVM implementations (SMO, LIBSVM and Simple-SVM) with similar accurateness.