Contemporary data in many scientific domains, such as images, media streams, biomedical omics, are naturally modeled as probability distributions in Wasserstein space instead of points in Euclidean space. Consequently, clustering methods for distributions are in high demand, as they provide exploratory frameworks to group objects with similarity. Clustering distribution-valued data in Wasserstein space often requires choosing the number of clusters in advance. We propose Relative Wasserstein Spatial Depth (RWSD) as a selection criterion for optimal number of clusters. It compares the depth of each distribution in its assigned cluster with its depth in competing clusters. We pair this criterion with Wasserstein K-means or a proposed K-medians algorithm. Under suitable assumptions, we establish consistency of the cluster centers and of the selected optimal number of clusters. We also give an error rate under two-stage sampling and characterize the robustness of RWSD under any fixed partition. In extensive simulations, RWSD selects the intended number of clusters under unequal separations, heterogeneous dispersion, heavy tails, and outliers, where silhouette score or the Davies-Bouldin Index often fails. Applications to MNIST images and flow cytometry data illustrate the practical value of RWSD. In some cases where a cluster is not geodesically convex and lacks a meaningful depth center, the RWSD can fail.

翻译：暂无翻译