Skip to content
Sagan

Paper

Affinity Graph Connectivity in Convex Clustering

Unreadunread

AI summary

arXiv:2605. 24673v1 Announce Type: new Abstract: We generalize finite-sample bounds for convex clustering to the setting where affinity weights appearing in the objective correspond to a general connected graph.