Efficient approaches for ℓ 2-ℓ 0 regularization and applications to feature selection in SVM
- 2 April 2016
- journal article
- research article
- Published by Springer Nature in Applied Intelligence
- Vol. 45 (2) , 549-565
Abstract
No abstract availableKeywords
Funding Information
- FOSTECT (FOSTECT.2015.BR.15.)
This publication has 39 references indexed in Scilit:
- Block Clustering Based on Difference of Convex Functions (DC) Programming and DC AlgorithmsNeural Computation, 2013
- Some sharp performance bounds for least squares regression with L1 regularizationThe Annals of Statistics, 2009
- One-step sparse estimates in nonconcave penalized likelihood modelsThe Annals of Statistics, 2008
- A coordinate gradient descent method for nonsmooth separable minimizationMathematical Programming, 2007
- The Adaptive Lasso and Its Oracle PropertiesJournal of the American Statistical Association, 2006
- Multicategory ψ-LearningJournal of the American Statistical Association, 2006
- Multicategory ψ-Learning and Support Vector Machine: Computational ToolsJournal of Computational and Graphical Statistics, 2005
- The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization ProblemsAnnals of Operations Research, 2005
- Subset selection in noise based on diversity measure minimizationIEEE Transactions on Signal Processing, 2003
- Ridge Regression: Biased Estimation for Nonorthogonal ProblemsTechnometrics, 1970