Enumerate Lasso Solutions for Feature Selection
暂无分享,去创建一个
[1] M. C. Sinclair,et al. A Comparative Study of k-Shortest Path Algorithms , 1996 .
[2] R. DeVore,et al. Compressed sensing and best k-term approximation , 2008 .
[3] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[4] Jeffrey Xu Yu,et al. Optimal Enumeration: Efficient Top-k Tree Matching , 2015, Proc. VLDB Endow..
[5] Muhammad Ali Amer,et al. Genome-wide association study of 107 phenotypes in a common set of Arabidopsis thaliana inbred lines , 2010, Nature.
[6] H. Zou,et al. Regularization and variable selection via the elastic net , 2005 .
[7] Martin J. Wainwright,et al. Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$ -Constrained Quadratic Programming (Lasso) , 2009, IEEE Transactions on Information Theory.
[8] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .
[9] M. Yuan,et al. Model selection and estimation in regression with grouped variables , 2006 .
[10] André Bardow,et al. The optimum is not enough: A near-optimal solution paradigm for energy systems synthesis , 2015 .
[11] R. Tibshirani,et al. Sparsity and smoothness via the fused lasso , 2005 .
[12] Dalit Naor,et al. On Near-Optimal Alignments of Biological Sequences , 1994, J. Comput. Biol..
[13] Honglak Lee,et al. Efficient L1 Regularized Logistic Regression , 2006, AAAI.
[14] Bjarni J. Vilhjálmsson,et al. Genome-wide association study of 107 phenotypes in Arabidopsis thaliana inbred lines , 2010 .
[15] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[16] Wenjiang J. Fu,et al. Asymptotics for lasso-type estimators , 2000 .
[17] C. O’Brien. Statistical Learning with Sparsity: The Lasso and Generalizations , 2016 .
[18] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.