Fast Discrete Distribution Clustering Using
Wasserstein Barycenter with Sparse Support
Jianbo Ye
The Pennsylvania State University, University Park, PA 16802
Panruo Wu
University of California, Riverside, CA 92521
James Z. Wang
Jia Li
The Pennsylvania State University, University Park, PA 16802
Abstract:
In a variety of research areas, the weighted bag of vectors and the
histogram are widely used descriptors for complex objects. Both can be
expressed as discrete distributions. D2-clustering pursues the minimum
total within-cluster variation for a set of discrete distributions
subject to the Kantorovich-Wasserstein metric. D2-clustering has a
severe scalability issue, the bottleneck being the computation of a
centroid distribution, called Wasserstein barycenter, that minimizes
its sum of squared distances to the cluster members. In this paper, we
develop a modified Bregman ADMM approach for computing the approximate
discrete Wasserstein barycenter of large clusters. In the case when
the support points of the barycenters are unknown and have low
cardinality, our method achieves high accuracy empirically at a much
reduced computational cost. The strengths and weaknesses of our method
and its alternatives are examined through experiments, and we
recommend scenarios for their respective usage. Moreover, we develop
both serial and parallelized versions of the algorithm. By
experimenting with large-scale data, we demonstrate the computational
efficiency of the new methods and investigate their convergence
properties and numerical stability. The clustering results obtained on
several datasets in different domains are highly competitive in
comparison with some widely used methods in the corresponding areas.
Full Paper in Color
(PDF, 4MB)
Citation:
Jianbo Ye, Panruo Wu, James Z. Wang and Jia Li, ``Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support,'' IEEE Transactions on Signal Processing, vol. 65, no. 9, pp. 2317-2332, 2017. [A version was posted in Sep 2015 at http://arxiv.org/abs/1510.00012]
Copyright 2017 IEEE.
Personal use of this
material is permitted. However, permission to reprint/republish this
material for advertising or promotional purposes or for creating new
collective works for resale or redistribution to servers or lists, or
to reuse any copyrighted component of this work in other works, must
be obtained from the IEEE.
Last Modified:
January 9, 2017
© 2017