Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
Abhimanyu DasDavid KempePublished in: CoRR (2011)
Keyphrases
- subset selection
- greedy algorithms
- greedy algorithm
- sparse approximation
- orthogonal matching pursuit
- feature selection
- hill climbing
- linear combination
- worst case
- sparse representation
- dynamic programming
- noise model
- sparse coding
- knapsack problem
- gaussian process
- objective function
- neural network
- np hard
- search algorithm
- search strategy
- data mining