On the sparseness of 1-norm support vector machines
Authors:
- Li ZhangLZLi Zhang
- Weida ZhouWZWeida Zhou
- 1 April 2010
- journal article
- Published by Elsevier in Neural Networks
- Vol. 23 (3) , 373-385
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (60603019, 60872135, 60970067, 60602064)
This publication has 26 references indexed in Scilit:
- Decomposition techniques for training linear programming support vector machinesNeurocomputing, 2009
- The hidden neurons selection of the wavelet networks using support vector machines and ridge regressionNeurocomputing, 2008
- Approximation and learning by greedy algorithmsThe Annals of Statistics, 2008
- Structured variable selection in support vector machinesElectronic Journal of Statistics, 2008
- OnL1-Norm Multiclass Support Vector MachinesJournal of the American Statistical Association, 2007
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Linear programming support vector machinesPattern Recognition, 2002
- Sample compression, learnability, and the Vapnik-Chervonenkis dimensionMachine Learning, 1995
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993