Clustering using Max-norm Constrained Optimization

02/25/2012
by   Ali Jalali, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2013

Matrix Completion via Max-Norm Constrained Optimization

Matrix completion has been well studied under the uniform sampling model...
research
08/18/2015

Robust Subspace Clustering via Smoothed Rank Approximation

Matrix rank minimizing subject to affine constraints arises in many appl...
research
12/02/2022

Fast Algorithm for Constrained Linear Inverse Problems

We consider the constrained Linear Inverse Problem (LIP), where a certai...
research
08/28/2018

Weighted total variation based convex clustering

Data clustering is a fundamental problem with a wide range of applicatio...
research
09/26/2013

Convex Relaxations of Bregman Divergence Clustering

Although many convex relaxations of clustering have been proposed in the...
research
03/11/2019

Diffusion K-means clustering on manifolds: provable exact recovery via semidefinite relaxations

We introduce the diffusion K-means clustering method on Riemannian subm...
research
08/19/2019

Robust and Efficient Fuzzy C-Means Clustering Constrained on Flexible Sparsity

Clustering is an effective technique in data mining to group a set of ob...

Please sign up or login with your details

Forgot password? Click here to reset