paper-with-me

홈 › Papers

On clustering uncertain and structured data with Wasserstein barycenters and a geodesic criterion for the number of clusters

2019-12-26 · G. I. Papayiannis, G. N. Domazakis, D. Drivaliaris, S. Koukoulas, A. E. Tsekrekos, A. N. Yannacopoulos

In this work clustering schemes for uncertain and structured data are considered relying on the notion of Wasserstein barycenters, accompanied by appropriate clustering indices based on the intrinsic geometry of the Wasserstein space where the clustering task is performed. Such type of clustering approaches are highly appreciated in many fields where the observational/experimental error is significant (e.g. astronomy, biology, remote sensing, etc.) or the data nature is more complex and the traditional learning algorithms are not applicable or effective to treat them (e.g. network data, interval data, high frequency records, matrix data, etc.). Under this perspective, each observation is identified by an appropriate probability measure and the proposed clustering schemes rely on discrimination criteria that utilize the geometric structure of the space of probability measures through core techniques from the optimal transport theory. The advantages and capabilities of the proposed approach and the geodesic criterion performance are illustrated through a simulation study and the implementation in two real world applications: (a) clustering eurozone countries according to their observed government bond yield curves and (b) classifying the areas of a satellite image to certain land uses categories, a standard task in remote sensing.

📄 PDF Abstract BibTeX arXiv:1912.11801

Code (0)

등록된 구현이 없습니다.

Tasks

AstronomyClustering

Similar Papers 제목 키워드 기반

Variational Wasserstein Barycenters for Geometric Clustering

2020-02-24 · Liang Mi

We propose to compute Wasserstein barycenters (WBs) by solving for Monge maps with variational principle. We discuss the metric properties of WBs and explore their connections, especially the connections of Monge WBs, to…

Clustering

Multilevel Clustering via Wasserstein Means

2017-06-13 · ICML 2017 8 · Nhat Ho, XuanLong Nguyen, Mikhail Yurochkin, Hung Hai Bui 외

We propose a novel approach to the problem of multilevel clustering, which aims to simultaneously partition data in each group and discover grouping patterns among groups in a potentially large hierarchically structured …

Clustering

On Efficient Multilevel Clustering via Wasserstein Distances

2019-09-19 · Viet Huynh, Nhat Ho, Nhan Dam, XuanLong Nguyen 외

We propose a novel approach to the problem of multilevel clustering, which aims to simultaneously partition data in each group and discover grouping patterns among groups in a potentially large hierarchically structured …

Clustering

Fast Computation of Wasserstein Barycenters

2013-10-16 · Marco Cuturi, Arnaud Doucet

We present new algorithms to compute the mean of a set of empirical probability measures under the optimal transport metric. This mean, known as the Wasserstein barycenter, is the measure that minimizes the sum of its Wa…

ClusteringConstrained Clustering

Wasserstein $K$-means for clustering probability distributions

2022-09-14 · Yubo Zhuang, Xiaohui Chen, Yun Yang

Clustering is an important exploratory data analysis technique to group objects based on their similarity. The widely used $K$-means clustering method relies on some notion of distance to partition data into a fewer numb…

Clustering