Web: http://arxiv.org/abs/2109.09589

May 5, 2022, 1:11 a.m. | Alexander Dunlap, Jean-Christophe Mourrat

stat.ML updates on arXiv.org arxiv.org

Sum-of-norms clustering is a convex optimization problem whose solution can
be used for the clustering of multivariate data. We propose and study a
localized version of this method, and show in particular that it can separate
arbitrarily close balls in the stochastic ball model. More precisely, we prove
a quantitative bound on the error incurred in the clustering of disjoint
connected sets. Our bound is expressed in terms of the number of datapoints and
the localization length of the functional.

arxiv clustering

More from arxiv.org / stat.ML updates on arXiv.org

Data Analyst, Patagonia Action Works

@ Patagonia | Remote

Data & Insights Strategy & Innovation General Manager

@ Chevron Services Company, a division of Chevron U.S.A Inc. | Houston, TX

Faculty members in Research areas such as Bayesian and Spatial Statistics; Data Privacy and Security; AI/ML; NLP; Image and Video Data Analysis

@ Ahmedabad University | Ahmedabad, India

Director, Applied Mathematics & Computational Research Division

@ Lawrence Berkeley National Lab | Berkeley, Ca

Business Data Analyst

@ MainStreet Family Care | Birmingham, AL

Assistant/Associate Professor of the Practice in Business Analytics

@ Georgetown University McDonough School of Business | Washington DC