Local versions of sum-of-norms clustering
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910525314564096 |
|---|---|
| author | Dunlap, Alexander Mourrat, Jean-Christophe |
| author_facet | Dunlap, Alexander Mourrat, Jean-Christophe |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_09589 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Local versions of sum-of-norms clustering Dunlap, Alexander Mourrat, Jean-Christophe Machine Learning Statistics Theory 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. |
| title | Local versions of sum-of-norms clustering |
| topic | Machine Learning Statistics Theory |
| url | https://arxiv.org/abs/2109.09589 |