On the use of Wasserstein metric in topological clustering of distributional data

09/09/2021
by   Guénaël Cabanes, et al.
0

This paper deals with a clustering algorithm for histogram data based on a Self-Organizing Map (SOM) learning. It combines a dimension reduction by SOM and the clustering of the data in a reduced space. Related to the kind of data, a suitable dissimilarity measure between distributions is introduced: the L_2 Wasserstein distance. Moreover, the number of clusters is not fixed in advance but it is automatically found according to a local data density estimation in the original space. Applications on synthetic and real data sets corroborate the proposed strategy.

READ FULL TEXT

page 11

page 12

page 13

research
04/28/2023

A new interpoint distance-based clustering algorithm using kernel density estimation

A novel nonparametric clustering algorithm is proposed using the interpo...
research
09/14/2022

Wasserstein K-means for clustering probability distributions

Clustering is an important exploratory data analysis technique to group ...
research
05/25/2018

COREclust: a new package for a robust and scalable analysis of complex data

In this paper, we present a new R package COREclust dedicated to the det...
research
12/26/2022

Covariance-based soft clustering of functional data based on the Wasserstein-Procrustes metric

We consider the problem of clustering functional data according to their...
research
06/23/2018

Variational Wasserstein Clustering

We propose a new clustering method based on optimal transportation. We s...
research
01/07/2022

Probabilistic spatial clustering based on the Self Discipline Learning (SDL) model of autonomous learning

Unsupervised clustering algorithm can effectively reduce the dimension o...
research
06/13/2017

Multilevel Clustering via Wasserstein Means

We propose a novel approach to the problem of multilevel clustering, whi...

Please sign up or login with your details

Forgot password? Click here to reset