Probabilistic Multilevel Clustering via Composite Transportation Distance
arXiv:1810.11911
Abstract
We propose a novel probabilistic approach to multilevel clustering problems based on composite transportation distance, which is a variant of transportation distance where the underlying metric is Kullback-Leibler divergence. Our method involves solving a joint optimization problem over spaces of probability measures to simultaneously discover grouping structures within groups and among groups. By exploiting the connection of our method to the problem of finding composite transportation barycenters, we develop fast and efficient optimization algorithms even for potentially large-scale multilevel datasets. Finally, we present experimental results with both synthetic and real data to demonstrate the efficiency and scalability of the proposed approach.
arXiv comment25 pages, 3 figures
Cited by in corpus (5)
- On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms
- Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problem
- Improving Mini-batch Optimal Transport via Partial Transportation
- Entropic Gromov-Wasserstein between Gaussian Distributions
- Variational Wasserstein Barycenters with c-Cyclical Monotonicity