搜索结果: 1-3 共查到“管理学 Subset Selection”相关记录3条 . 查询时间(0.046 秒)
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
Submodular meets Spectral Greedy Algorithms for Subset Selection Sparse Approximation Dictionary Selection
font style='font-size:12px;'>
2011/3/23
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can be viewed in the cont...
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
Greedy Algorithms Subset Selection Dictionary Selection
font style='font-size:12px;'>
2011/3/22
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can be viewed in the cont...
Best subset selection，persistence in high-dimensional statistical learning and optimization under L1 constraint
Variable selection persistence
font style='font-size:12px;'>
2010/4/26
Let (Y,X1, . . . ,Xm) be a random vector. It is desired to predict Y
based on (X1, . . . ,Xm). Examples of prediction methods are regression,
classification using logistic regression or separating h...