Graph Approximation and Clustering on a Budget

Ethan Fetaya, Ohad Shamir, Shimon Ullman

Abstract: We consider the problem of learning from a similarity matrix (such as spectral clustering and low-dimensional embedding), when computing pairwise similarities are costly, and only a limited number ...