Sparse learning for support vector classification
Authors:
- Kaizhu HuangKHKaizhu Huang
- Danian ZhengDZDanian Zheng
- Jun SunJSJun Sun
- Yoshinobu HottaYHYoshinobu Hotta
- Katsuhito FujimotoKFKatsuhito Fujimoto
- Satoshi NaoiSNSatoshi Naoi
- 1 October 2010
- journal article
- research article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 31 (13) , 1944-1951
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Maxi–Min Margin Machine: Learning Large Margin Classifiers Locally and GloballyIEEE Transactions on Neural Networks, 2008
- Gene Feature Extraction Using T-Test Statistics and Kernel Partial Least SquaresLecture Notes in Computer Science, 2006
- An efficient method for simplifying support vector machines2005
- Adaptive sparseness for supervised learningIEEE Transactions on Pattern Analysis and Machine Intelligence, 2003
- Improvements to Platt's SMO Algorithm for SVM Classifier DesignNeural Computation, 2001
- A new method for sparsity control in support vector classification and regressionPattern Recognition, 2001
- New Support Vector AlgorithmsNeural Computation, 2000
- Support vectors selection by linear programming2000
- Input space versus feature space in kernel-based methodsIEEE Transactions on Neural Networks, 1999
- A Tutorial on Support Vector Machines for Pattern RecognitionData Mining and Knowledge Discovery, 1998