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.

翻译：我们研究集群和遮盖嵌入的松绑,重点是不对称案例(联合集群和不对称遮盖嵌入),了解它们与经(Charikar,2002年)研究的LSH的关系和与最高温球的关系,以及它们的对称和不对称版本之间的差异。