mlsanityData to 7 Oct 2026

Statistical Properties of Convex Clustering

arXiv 1503.08340 ↗First posted 28 Mar 2015stat.ME math.ST stat.THcited by 19

Not on the map. Why?

Abstract (arXiv)

In this manuscript, we study the statistical properties of convex clustering. We establish that convex clustering is closely related to single linkage hierarchical clustering and k-means clustering. In addition, we derive the range of tuning parameter for convex clustering that yields a non-trivial solution. We also provide an unbiased estimate of the degrees of freedom, and provide a finite sample bound for the prediction error for convex clustering. We compare convex clustering to some traditional clustering methods in simulation studies.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Mar 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 4; 2023: 3; 2024: 1; 2025: 4; 2026: 2.

19 papers.

Sort:

  1. 2022GraphMAD: Graph Mixup for Data Augmentation using Data-Driven Convex Clusteringcited by 13
  2. 2021Uniform Concentration Bounds toward a Unified Framework for Robust Clusteringcited by 10
  3. 2021Local versions of sum-of-norms clusteringcited by 4
  4. 2021Sum-of-norms clustering does not separate nearby ballscited by 3
  5. 2021On Convex Clustering Solutionscited by 3
  6. 2022Bregman Power k-Means for Clustering Exponential Family Datacited by 3
  7. 2023Multi-Task Learning Regression via Convex Clusteringcited by 3
  8. 2021Network Clustering for Latent State and Changepoint Detectioncited by 1
  9. 2023Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guaranteescited by 1
  10. 2022Fusion Subspace Clustering for Incomplete Datacited by 0
  11. 2022Simple and Scalable Algorithms for Cluster-Aware Precision Medicinecited by 0
  12. 2023Re-embedding data to strengthen recovery guarantees of clusteringcited by 0
7 more
  1. 2024Adaptive Self-supervised Robust Clustering for Unstructured Data with Unknown Cluster Numbercited by 0
  2. 2025Tree-Guided L1-Convex Clusteringcited by 0
  3. 2025Bounds on Perfect Node Classification: A Convex Graph Clustering Perspectivecited by 0
  4. 2025A New Framework for Convex Clustering in Kernel Spaces: Finite Sample Bounds, Consistency and Performance Insightscited by 0
  5. 2025Convex Clustering Redefined: Robust Learning with the Median of Means Estimatorcited by 0
  6. 2026Biconvex Biclusteringcited by 0
  7. 2026Affinity Graph Connectivity in Convex Clusteringcited by 0