Clustering using Max-norm Constrained Optimization
classification
💻 cs.LG
stat.ML
keywords
clusteringconvexmax-normotherapproachesbetterclustercompared
read the original abstract
We suggest using the max-norm as a convex surrogate constraint for clustering. We show how this yields a better exact cluster recovery guarantee than previously suggested nuclear-norm relaxation, and study the effectiveness of our method, and other related convex relaxations, compared to other clustering approaches.
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.