arXiv Statistics ML
Relative Wasserstein Spatial Depth for Cluster Number Selection in Distributional Data
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
Hugging Face Trending Papers
Jun 29
Adjusted Wasserstein distances for bridging empirical and true distributions with applications to MDS
This paper examines how metric adjustments to Multidimensional Scaling (MDS) can enhance its effectiveness as a visual tool for pattern recognition. The distance under consideration, referred to as Max-D-SW, is an adjustment of the Max-Sliced Wasserstein distance.
arXiv Machine Learning
Jun 30
Adjusted Wasserstein distances for bridging empirical and true distributions with applications to MDS
arXiv:2606. 29665v1 Announce Type: cross Abstract: This paper examines how metric adjustments to Multidimensional Scaling (MDS) can enhance its effectiveness as a visual tool for pattern recognition.
arXiv Machine Learning
Jun 30
Highly Data Parallelizable Estimation of the Sliced-Wasserstein Distance Using Cumulative Distribution Functions
arXiv:2606. 30310v1 Announce Type: cross Abstract: The Sliced Wasserstein (SW) distance has emerged as a computationally attractive alternative to the Wasserstein distance by leveraging one-dimensional optimal transport along random projections.
arXiv Machine Learning
Aug 12
Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms
arXiv:2608. 11016v1 Announce Type: cross Abstract: Clustering is a fundamental class of data analysis techniques with the most important representatives being centroid-based methods like $k$-means.
arXiv AI
Jun 16
Canonical Variates in Wasserstein Metric Space
arXiv:2405. 15768v2 Announce Type: replace-cross Abstract: In this paper, we address the classification of instances represented by distributions on a vector space rather than single points.
Hugging Face Trending Papers
Aug 11
Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms
Clustering is a fundamental class of data analysis techniques with the most important representatives being centroid-based methods like $k$-means. Such methods are strongly connected to quantization problems, which aim to approximate general probability measures with discrete ones.