Clustering Hamming Embedding Generalized LSH And The Max Norm

Neyshabur Behnam, Makarychev Yury, Srebro Nathan. Arxiv 2014

[Paper]    
ARXIV LSH Unsupervised

We study the convex relaxation of clustering and hamming embedding, focusing on the asymmetric case (co-clustering and asymmetric hamming embedding), understanding their relationship to LSH as studied by (Charikar 2002) and to the max-norm ball, and the differences between their symmetric and asymmetric versions.

Similar Work