A Fast Greedy Algorithm for Generalized Column Subset Selection
Data Structures and Algorithms
2013-12-25 v1 Machine Learning
Machine Learning
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.
Cite
@article{arxiv.1312.6820,
title = {A Fast Greedy Algorithm for Generalized Column Subset Selection},
author = {Ahmed K. Farahat and Ali Ghodsi and Mohamed S. Kamel},
journal= {arXiv preprint arXiv:1312.6820},
year = {2013}
}
Comments
NIPS'13 Workshop on Greedy Algorithms, Frank-Wolfe and Friends