Efficient algorithms for selecting features with arbitrary group constraints via group lasso

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2013, Pages 379-388

  Kong, Deguang ^a   Ding, Chris ^a  

^a University of Texas at Arlington   (United States)

Author keywords

exclusive lasso; feature group constraint; feature selection; group lasso; lasso

Indexed keywords

ACCELERATED PROXIMAL GRADIENT METHODS; CLASSIFICATION TASKS; DIFFERENT STRUCTURE; EXCLUSIVE LASSO; FEATURE GROUPS; GROUP CONSTRAINTS; GROUP LASSOS; LASSO;

ALGORITHMS; DATA MINING; FEATURE EXTRACTION; FORESTRY; GRADIENT METHODS;

PROBLEM SOLVING;

ALGORITHMS; DATA PROCESSING; FORESTRY; PROBLEM SOLVING;

EID: 84896861058     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2013.168     Document Type: Conference Paper

References (42)

1. A. Argyriou, C. Micchelli, M. Pontil, L. Shen, and Y. Xu. Efficient first order methods for linear composite regularizers. Computing Research Repository, 2011.
2. F. Bach, R. Jenatton, J. Mairal, and G. Obozinski. Structured sparsity through convex optimization. CoRR, abs/1109.2397, 2011.
3. F. R. Bach. Consistency of the group lasso and multiple kernel learning. Journal of Machine Learning Research, 9:1179-1225, 2008.
4. A. Beck and M. Teboulle. A fast iterative shrinkagethresholding algorithm for linear inverse problems. SIAM J. Imaging Sci., 2(1):183-202, 2009.
5. A. Beck and M. Teboulle. A fast iterative shrinkagethresholding algorithm for linear inverse problems. SIAM J. Imaging Sciences, 2(1):183-202, 2009.
6. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1):1-122, 2011.
7. V. Cevher, M. F. Duarte, C. Hegde, and R. G. Baraniuk. Sparse signal recovery using markov random fields. In NIPS, pages 257-264, 2008.
8. R. Chartrand and W. Yin. Iteratively reweighted algorithms for compressive sensing. In ICASSP, pages 3869-3872, 2008.
9. C. Chen, Y. Li, and J. Huang. Learning with forest sparsity. CoRR, abs/1211.4657, 2012.
10. X. Chen, Q. Lin, S. Kim, J. Carbonell, and E. Xing. Smoothing proximal gradient method for general structured sparse learning. In UAI, pages 105-114, 2011.
11. H. Chuang, E. Lee, Y.-T. Liu, D. Lee, and T. Ideker. Networkbased classification of breast cancer metastasis. Molecular Systems Biology, 3(140), 2007.
12. I. Daubechies, R. DeVore, M. Fornasier, and C. S. Güntürk. Iteratively re-weighted least squares minimization: Proof of faster than linear rate for sparse recovery. In CISS, pages 26-29, 2008.
13. C. H. Q. Ding and D. Kong. Nonnegative matrix factorization using a robust error function. In ICASSP, pages 2033-2036, 2012.
14. D. L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289-1306, 2006.
15. J. Fan, Y. Feng, and R. Song. Nonparametric independence screening in sparse ultra-high dimensional additive models. J. Amer. Statist. Assoc., 106:544-557, 2011.
16. J. Huang, J. L. Horowitz, and F. Wei. Variable selection in nonparametric additive models. Technical report, 2010.
17. J. Huang, T. Zhang, and D. N. Metaxas. Learning with structured sparsity. Journal of Machine Learning Research, 12:3371-3412, 2011.
18. L. Jacob, G. Obozinski, and J.-p. Vert. Group lasso with overlap and graph lasso. In ICML, page 55, 2009.
19. R. Jenatton, J. Audibert, and F. Bach. Structured variable selection with sparsity-inducing norms. Technical report, arXiv:0904.3523, 2009.
20. R. Jenatton, J. Mairal, G. Obozinski, and F. Bach. Proximal methods for sparse hierarchical dictionary learning. In ICML, 2010.
21. K. Kavukcuoglu, M. Ranzato, R. Fergus, and Y. LeCun. Learning invariant features through topographic filter maps. In CVPR, pages 1605-1612, 2009.
22. S. Kim, K. Sohn, and E. Xing. A multivariate regression approach to association analysis of a quantitative trait network. Bioinformatics, 25(12):204-212, 2009.
23. S. Kim and E. Xing. Tree-guided group lasso for multi-task regression with structured sparsity. In ICML, 2010.
24. D. Kong and C. H. Q. Ding. An iterative locally linear embedding algorithm. In ICML, 2012.
25. D. Kong, C. H. Q. Ding, and H. Huang. Robust nonnegative matrix factorization using 121-norm. In CIKM, pages 673-682, 2011.
26. D. Kong, C. H. Q. Ding, H. Huang, and H. Zhao. Multi-label relieff and f-statistic feature selections for image annotation. In CVPR, pages 2352-2359, 2012.
27. D. Kong, M. Zhang, and C. H. Q. Ding. Minimal shrinkage for noisy data recovery using schatten-p norm objective. In ECML/PKDD, pages 177-193, 2013.
28. J. Liu, S. Ji, and J. Ye. Multi-task feature learning via efficient l2,1-norm minimization. In UAI, pages 339-348, 2009.
29. J. Liu and J. Ye. Moreau-yosida regularization for grouped tree structure learning. In NIPS, pages 1459-1467, 2010.
30. J. Mairal, R. Jenatton, G. Obozinski, and F. Bach. Network flow algorithms for structured sparsity. In NIPS, 2010.
31. Y. Nesterov. Gradient methods for minimizing composite objective function. ECORE Discussion Paper, 2007.
32. 2,1-norms minimization. In NIPS, pages 1813-1821, 2010.
33. N. S. Rao, R. D. Nowak, S. Wright, and N. Kingsbury. Convex approaches to model wavelet sparsity patterns. In ICIP, pages 1917-1920, 2011.
34. p. Ravikumar, H. Liu, J. Lafferty, and L. Wasserman. Spam: Sparse additive models. In NIPS. MIT Press, 2007.
35. A. Subramanian, p. Tamayo, and et al. Gene set enrichment analysis: a knowledge-based approach for interpreting genome-wide expression profiles. Proceedings of the National Academy of Sciences, 102(43):15545-15550, 2005.
36. R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B, 58:267-288, 1994.
37. R. Tibshirani, M. Saunders, and S. Rosset. Sparsity and smoothness via the fused lasso. Journal of the Royal Sta-tistical Society, Series B, 67(1):91-108, 2005.
38. M. Vijver, Y. He, and et al. A gene-expression signature as a predictor of survival in breast cancer. New England Journal of Medicine, 347(25), 2002.
39. J. Yin, X. Chen, and E. p. Xing. Group sparse additive models. In ICML, 2012.
40. L. Yuan, J. Liu, and J. Ye. Efficient methods for overlapping group lasso. In NIPS, pages 352-360, 2011.
41. M. Yuan and Y. Lin. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B, 68:49-67, 2006.
42. p. Zhao, G. Rocha, and B. Yu. D the composite absolute penalties family for grouped and hierarchical variable selection. Annals of Statistics, 37(6A):3468-3497, 2009.