A New Framework for Convex Clustering in Kernel Spaces: Finite Sample Bounds, Consistency and Performance Insights
DGX agentarXiv:2511.05159v2 Announce Type: replace-cross Abstract: Convex clustering is a well-regarded clustering method, resembling the similar centroid-based approach of Lloyd's k-means, without requiring a