3 search results - page 1 / 1 » Submodular meets Spectral: Greedy Algorithms for Subset Sele... |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
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 ...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
Many applications on blog search and mining often meet the challenge of handling huge volume of blog data, in which one single blog could contain hundreds or even thousands of ent...