Wasserstein k-means with sparse simplex projection

Takumi Fukunaga, Hiroyuki Kasai

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

This paper presents a proposal of a faster Wasserstein k-means algorithm for histogram data by reducing Wasserstein distance computations and exploiting sparse simplex projection. We shrink data samples, centroids, and the ground cost matrix, which leads to considerable reduction of the computations used to solve optimal transport problems without loss of clustering quality. Furthermore, we dynamically reduced the computational complexity by removing lower-valued data samples and harnessing sparse simplex projection while keeping the degradation of clustering quality lower. We designate this proposed algorithm as sparse simplex projection based Wasserstein k-means, or SSPW k-means. Numerical evaluations conducted with comparison to results obtained using Wasserstein k-means algorithm demonstrate the effectiveness of the proposed SSPW k-means for real-world datasets.

本文言語English
ホスト出版物のタイトルProceedings of ICPR 2020 - 25th International Conference on Pattern Recognition
出版社Institute of Electrical and Electronics Engineers Inc.
ページ1627-1634
ページ数8
ISBN(電子版)9781728188089
DOI
出版ステータスPublished - 2020
イベント25th International Conference on Pattern Recognition, ICPR 2020 - Virtual, Milan, Italy
継続期間: 2021 1 102021 1 15

出版物シリーズ

名前Proceedings - International Conference on Pattern Recognition
ISSN(印刷版)1051-4651

Conference

Conference25th International Conference on Pattern Recognition, ICPR 2020
国/地域Italy
CityVirtual, Milan
Period21/1/1021/1/15

ASJC Scopus subject areas

  • コンピュータ ビジョンおよびパターン認識

フィンガープリント

「Wasserstein k-means with sparse simplex projection」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル