A Fast Greedy Algorithm for Generalized Column Subset Selection
Abstract
This paper defines a generalized column subset selection problem which is concerned with the selection of a few columns from a source matrix A that best approximate the span of a target matrix B. The paper then proposes a fast greedy algorithm for solving this problem and draws connections to different problems that can be efficiently solved using the proposed algorithm.
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2013
- DOI:
- arXiv:
- arXiv:1312.6820
- Bibcode:
- 2013arXiv1312.6820F
- Keywords:
-
- Computer Science - Data Structures and Algorithms;
- Computer Science - Machine Learning;
- Statistics - Machine Learning
- E-Print:
- NIPS'13 Workshop on Greedy Algorithms, Frank-Wolfe and Friends