Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support

DOI10.1109/TSP.2017.2659647zbMath1414.94709arXiv1510.00012OpenAlexW2963995333MaRDI QIDQ4620758

Panruo Wu, Jianbo Ye, James Z. Wang, Jia Li

Publication date: 8 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.00012

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (14)

Wasserstein Barycenters Are NP-Hard to Compute ⋮ Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees ⋮ Multisource Single-Cell Data Integration by MAW Barycenter for Gaussian Mixture Models ⋮ On the use of Wasserstein distance in the distributional analysis of human decision making under uncertainty ⋮ Unnamed Item ⋮ Simple approximative algorithms for free-support Wasserstein barycenters ⋮ On Geometric Prototype and Applications ⋮ An inexact PAM method for computing Wasserstein barycenter with unknown supports ⋮ Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning ⋮ Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications ⋮ Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures ⋮ On the computation of Wasserstein barycenters ⋮ Geometry-Sensitive Ensemble Mean Based on Wasserstein Barycenters: Proof-of-Concept on Cloud Simulations ⋮ Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms

This page was built for publication: Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support