A Fast Greedy Algorithm for Generalized Column Subset Selection
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 24 Dec 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.