A feasible nonconvex relaxation approach to feature selection

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2011, Pages 356-361

  Gao, Cuixia ^a   Wang, Naiyan ^a   Yu, Qi ^a   Zhang, Zhihua ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE UPDATE; EFFICIENT METHOD; MINIMAX; MINIMIZATION METHODS; NONCONVEX; OPTIMIZATION FRAMEWORK; OPTIMIZATION PROBLEMS; SMOOTHLY CLIPPED ABSOLUTE DEVIATION; SUPERVISED LEARNING PROBLEMS; TUNING PARAMETER; VARIABLE SELECTION PROBLEMS;

ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

FEATURE EXTRACTION;

EID: 80055039401     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Breheny, P., and Huang, J. 2010. Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection. To appear in the Annals of Applied Statistics.
2. 1 minimization. The Journal of Fourier Analysis and Applications 14(5):877-905.
3. Efron, B.; Hastie, T.; Johnstone, I.; and Tibshirani, R. 2004. Least angle regression (with discussions). The Annals of Statistics 32(2):407-499.
4. Fan, J., and Li, R. 2001. Variable selection via nonconcave penalized likelihood and its Oracle properties. Journal of the American Statistical Association 96:1348-1361.
5. Friedman, J. H.; Hastie, T.; Hoefling, H.; and Tibshirani, R. 2007. Pathwise coordinate optimization. The Annals of Applied Statistics 2(1):302-332.
6. Hunter, D. R., and Li, R. 2005. Variable selection using MM algorithms. The Annals of Statistics 33:1617-1642. (Pubitemid 41423982)
7. Lange, K.; Hunter, D.; and Yang, I. 2000. Optimization transfer using surrogate objective functions(with discussion). Journal of Computational and Graphical Statistics 9:1-59.
8. Mazumder, R.; Friedman, J.; and Hastie, T. 2009. Sparsenetxoordinate descent with non-convex penalties. Technical report, Department of Statistics, Stanford University.
9. Tibshirani, R. 1996. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B 58:267-288.
10. 2 methods for finding sparse solutions. IEEE Journal of Selected Topics in Signal Processing 4(2):317-329.
11. Zhang, C.-H. 2010a. Nearly unbiased variable selection under minimax concave penalty. The Annals of Statistics 38:894-942.
12. Zhang, T. 2010b. Analysis of multi-stage convex relaxation for sparse regularization. Journal of Machine Learning Research 11:1081-1107.
13. Zou, H., and Li, R. 2008. One-step sparse estimates in nonconcave penalized likelihood models. The Annals of Statistics 36(4):1509-1533.
14. Zou, H. 2006. The adaptive lasso and its Oracle properties. Journal of the American Statistical Association 101(476):1418-1429.