Simultaneous Grouping and Denoising via Sparse Convex Wavelet Clustering

Abstract

Clustering is a ubiquitous problem in data science and signal processing. In many applications where we observe noisy signals, it is common practice to first denoise the data, perhaps using wavelet denoising, and then to apply a clustering algorithm. In this paper, we develop a sparse convex wavelet clustering approach that simultaneously denoises and discovers groups. Our approach utilizes convex fusion penalties to achieve agglomeration and group-sparse penalties to denoise through sparsity in the wavelet domain. In contrast to common practice which denoises then clusters, our method is a unified, convex approach that performs both simultaneously. Our method yields denoised (wavelet-sparse) cluster centroids that both improve interpretability and data compression. We demonstrate our method on synthetic examples and in an application to NMR spectroscopy.

arXiv commentTo appear in IEEE DSLW 2021

References in corpus (9)

• Support union recovery in high-dimensional multivariate regression
• Empirical Bayes selection of wavelet thresholds
• Splitting Methods for Convex Clustering
• Wavelet methods in statistics: Some recent developments and their applications
• Convex Biclustering
• Clustering functional data using wavelets
• Sparse Convex Clustering
• Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
• Splitting Methods for Convex Bi-Clustering and Co-Clustering