A Fast Greedy Algorithm for Generalized Column Subset Selection
Farahat, Ahmed K. · Ghodsi, Ali · Kamel, Mohamed S.
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.