On clustering uncertain and structured data with Wasserstein barycenters and a geodesic criterion for the number of clusters
From MaRDI portal
Publication:3389669
DOI10.1080/00949655.2021.1903463OpenAlexW3149504070WikidataQ114642271 ScholiaQ114642271MaRDI QIDQ3389669FDOQ3389669
Authors:
Publication date: 23 March 2022
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949655.2021.1903463
Cites Work
- Functional Clustering and Identifying Substructures of Longitudinal Data
- High-dimensional data clustering
- Robust clustering tools based on optimal transportation
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Barycenters in the Wasserstein space
- Title not available (Why is that?)
- Dynamic clustering for interval data based on \(L_2\) distance
- Fréchet means and Procrustes analysis in Wasserstein space
- Clustering of time series data -- a survey
- Model-based clustering for multivariate functional data
- A convexity principle for interacting gases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Functional Clustering by Bayesian Wavelet Methods
- Existence and consistency of Wasserstein barycenters
- A fixed-point approach to barycenters in Wasserstein space
- Numerical methods for matching for teams and Wasserstein barycenters
- Iterative Bregman projections for regularized transportation problems
- Distribution's template estimate with Wasserstein metrics
- Sliced and Radon Wasserstein barycenters of measures
- On the computation of Wasserstein barycenters
- Partitional clustering algorithms for symbolic interval data based on single adaptive distances
- Wasserstein barycenters over Riemannian manifolds
- On the Bures-Wasserstein distance between positive definite matrices
- Procrustes metrics on covariance operators and optimal transportation of Gaussian processes
- Hybrid Wasserstein distance and fast distribution clustering
- A learning algorithm for source aggregation
- Time series \(k\)-means: a new \(k\)-means type smooth subspace clustering for time series data
Cited In (3)
Uses Software
This page was built for publication: On clustering uncertain and structured data with Wasserstein barycenters and a geodesic criterion for the number of clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389669)