Statistical Properties of Convex Clustering

2015/03/28 by Tan, Kean Ming, Witten, Daniela · 3 citations
#FOS: Computer and information sciences #FOS: Mathematics #Methodology (stat.ME) #Statistics Theory (math.ST)

paper · doi:10.48550/arxiv.1503.08340

Abstract

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.

Cited by

• Convex Clustering Redefined: Robust Learning with the Median of Means Estimator
• A New Framework for Convex Clustering in Kernel Spaces: Finite Sample Bounds, Consistency and Performance Insights
• Bounds on Perfect Node Classification: A Convex Graph Clustering Perspective

Related

• The Why and How of Convex Clustering
• On Convex Clustering Solutions
• Convex Clustering Redefined: Robust Learning with the Median of Means Estimator
• Convex Clustering through MM: An Efficient Algorithm to Perform Hierarchical Clustering
• Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees