Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support

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 Kantorov...

Full description

Bibliographic Details

Published in:	IEEE transactions on signal processing Vol. 65; no. 9; pp. 2317 - 2332
Main Authors:	Jianbo Ye, Panruo Wu, Wang, James Z., Jia Li
Format:	Journal Article
Language:	English
Published:	IEEE 01.05.2017
Subjects:	ADMM clustering Clustering algorithms Discrete distribution Electronic mail Histograms K-means large-scale learning Optimization parallel computing Prototypes Signal processing algorithms Time complexity
ISSN:	1053-587X, 1941-0476
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!