Least Squares Support Vector Machine Classifiers
Neural Processing Letters
Proximal support vector machine classifiers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
A Tutorial on Support Vector Machines for Pattern Recognition
Data Mining and Knowledge Discovery
Choosing Multiple Parameters for Support Vector Machines
Machine Learning
A parallel mixture of SVMs for very large scale problems
Neural Computation
Sparse bayesian learning and the relevance vector machine
The Journal of Machine Learning Research
Sparseness of support vector machines
The Journal of Machine Learning Research
A Stochastic Optimization Approach for Parameter Tuning of Support Vector Machines
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
Core Vector Machines: Fast SVM Training on Very Large Data Sets
The Journal of Machine Learning Research
Fast Kernel Classifiers with Online and Active Learning
The Journal of Machine Learning Research
Building Support Vector Machines with Reduced Classifier Complexity
The Journal of Machine Learning Research
Domains of Competence of Artificial Neural Networks Using Measures of Separability of Classes
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
New separating hyperplane method with application to the optimisation of direct marketing campaigns
Pattern Recognition Letters
Information Sciences: an International Journal
Hi-index | 0.01 |
Training algorithms for radial basis function kernel classifiers (RBFKCs), such as the support vector machine (SVM), often produce computationally burdensome classifiers when large training sets are used. Furthermore, the developer cannot directly control this complexity. The proposed incremental asymmetric proximal support vector machine (IAPSVM) employs a greedy search across the training data to select the basis vectors of the classifier, and tunes parameters automatically using the simultaneous perturbation stochastic approximation (SPSA) after incremental additions are made. The resulting classifier accuracy, using an a priori chosen run-time complexity, compares favorably to SVMs of similar complexity whose parameters have been tuned manually.