Shubhayan Pan

A New Framework for Convex Clustering in Kernel Spaces: Finite Sample Bounds, Consistency and Performance Insights

Convex clustering is a well-regarded clustering method, resembling the similar centroid-based approach of Lloyd’s k-means, without requiring a predefined cluster count. It starts with each data point as its centroid and iteratively merges them. Despite its advantages, this method can fail when deali