Clustering, Hamming Embedding, Generalized LSH and the Max Norm
classification
💻 cs.LG
keywords
asymmetricembeddinghammingclusteringballcasecharikarco-clustering
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.