Rough margin based core vector machine

Authors:
Gang Niu;Bo Dai;Lin Shang;Yangsheng Ji
Affiliations:
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, P.R.China;NLPR/LIAMA, Institute of Automation, Chinese Academy of Science, Beijing, P.R.China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, P.R.China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, P.R.China
Venue:
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Year:
2010

Citing 13
Cited 0

Support-Vector Networks

Machine Learning
Fast training of support vector machines using sequential minimal optimization

Advances in kernel methods
Sparse Greedy Matrix Approximation for Machine Learning

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Core Vector Machines: Fast SVM Training on Very Large Data Sets

The Journal of Machine Learning Research
Core Vector Regression for very large regression problems

ICML '05 Proceedings of the 22nd international conference on Machine learning
Training ν-Support Vector Classifiers: Theory and Algorithms

Neural Computation
New Support Vector Algorithms

Neural Computation
Inference with the Universum

ICML '06 Proceedings of the 23rd international conference on Machine learning
Multiclass core vector machine

Proceedings of the 24th international conference on Machine learning
Simpler core vector machines with enclosing balls

Proceedings of the 24th international conference on Machine learning
A rough margin based support vector machine

Information Sciences: an International Journal
LIBSVM: A library for support vector machines

ACM Transactions on Intelligent Systems and Technology (TIST)
Generalized Core Vector Machines

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The recently proposed rough margin based support vector machine (RMSVM) could tackle the overfitting problem due to outliers effectively with the help of rough margins. However, the standard solvers for them are time consuming and not feasible for large datasets. On the other hand, the core vector machine (CVM) is an optimization technique based on the minimum enclosing ball that can scale up an SVM to handle very large datasets. While the 2-norm error used in the CVM might make it theoretically less robust against outliers, the rough margin could make up this deficiency. Therefore we propose our rough margin based core vector machine algorithms. Experimental results show that our algorithms hold the generalization performance almost as good as the RMSVM on large scale datasets and improve the accuracy of the CVM significantly on extremely noisy datasets, whilst cost much less computational resources and are often faster than the CVM.