On Efficient Multilevel Clustering via Wasserstein Distances
We propose a novel approach to the problem of multilevel clustering, which aims to simultaneously partition data in each group and discover grouping patterns among groups in a potentially large hierarchically structured corpus of data. Our method involves a joint optimization formulation over several spaces of discrete probability measures, which are endowed with Wasserstein distance metrics. We propose several variants of this problem, which admit fast optimization algorithms, by exploiting the connection to the problem of finding Wasserstein barycenters. Consistency properties are established for the estimates of both local and global clusters. Finally, experimental results with both synthetic and real data are presented to demonstrate the flexibility and scalability of the proposed approach.
Code (1)
Tasks
ClusteringSimilar Papers 제목 키워드 기반
Multilevel Clustering via Wasserstein Means
We propose a novel approach to the problem of multilevel clustering, which aims to simultaneously partition data in each group and discover grouping patterns among groups in a potentially large hierarchically structured …
ClusteringTree-Wasserstein Barycenter for Large-Scale Multilevel Clustering and Scalable Bayes
We study in this paper a variant of Wasserstein barycenter problem, which we refer to as tree-Wasserstein barycenter, by leveraging a specific class of ground metrics, namely tree metrics, for Wasserstein distance. Drawi…
ClusteringFuzzy clustering of distribution-valued data using adaptive L2 Wasserstein distances
Distributional (or distribution-valued) data are a new type of data arising from several sources and are considered as realizations of distributional variables. A new set of fuzzy c-means algorithms for data described by…
ClusteringVariable SelectionWasserstein-based Kernels for Clustering: Application to Power Distribution Graphs
Many data clustering applications must handle objects that cannot be represented as vector data. In this context, the bag-of-vectors representation can be leveraged to describe complex objects through discrete distributi…
ClusteringVariational Wasserstein Clustering
We propose a new clustering method based on optimal transportation. We solve optimal transportation with variational principles, and investigate the use of power diagrams as transportation plans for aggregating arbitrary…
ClusteringDomain AdaptationRepresentation Learning