Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
Convex clustering is a promising new approach to the classical problem of clustering, combining strong performance in empirical studies with rigorous theoretical foundations. Despite these advantages, convex clustering has not been widely adopted, due to its computationally intensive nature and its lack of compelling visualizations. To address these impediments, we …