搜索结果: 1-3 共查到“管理学 greedy algorithms”相关记录3条 . 查询时间(0.09 秒)
Sparse approximation and recovery by greedy algorithms in Banach spaces
Sparse approximation recovery greedy algorithms Banach spaces
2013/4/28
We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to ...
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
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
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...