Splitting Methods for Convex Clustering

Abstract

Clustering is a fundamental problem in many scientific applications. Standard methods such as $k$-means, Gaussian mixture models, and hierarchical clustering, however, are beset by local minima, which are sometimes drastically suboptimal. Recently introduced convex relaxations of $k$-means and hierarchical clustering shrink cluster centroids toward one another and ensure a unique global minimizer. In this work we present two splitting methods for solving the convex clustering problem. The first is an instance of the alternating direction method of multipliers (ADMM); the second is an instance of the alternating minimization algorithm (AMA). In contrast to previously considered algorithms, our ADMM and AMA formulations provide simple and unified frameworks for solving the convex clustering problem under the previously studied norms and open the door to potentially novel norms. We demonstrate the performance of our algorithm on both simulated and real data examples. While the differences between the two algorithms appear to be minor on the surface, complexity analysis and numerical experiments show AMA to be significantly more efficient.

37 pages, 6 figures

Cited by in corpus (14)

• Network Lasso: Clustering and Optimization in Large Graphs
• Convex Biclustering
• Nonparametric Density Estimation for High-Dimensional Data - Algorithms and Applications
• Sparse Convex Clustering
• Convex Clustering: An Attractive Alternative to Hierarchical Clustering
• Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
• Convex Subspace Clustering by Adaptive Block Diagonal Representation
• Nonconvex Optimization via MM Algorithms: Convergence Theory
• Splitting Methods for Convex Bi-Clustering and Co-Clustering
• Automatic Registration and Clustering of Time Series
• Simultaneous Grouping and Denoising via Sparse Convex Wavelet Clustering
• Local versions of sum-of-norms clustering
• Selective inference after convex clustering with ${\ell }_1$ penalization
• Clustering Hierarchies via a Semi-Parametric Generalized Linear Mixed Model: a statistical significance-based approach