Solving Soft Clustering Ensemble via $k$-Sparse Discrete Wasserstein Barycenter

2021-12-01 · NeurIPS 2021 12 · Ruizhe Qin, Mengying Li, Hu Ding

Clustering ensemble is one of the most important problems in ensemble learning. Though it has been extensively studied in the past decades, the existing methods often suffer from the issues like high computational complexity and the difficulty on understanding the consensus. In this paper, we study the more general soft clustering ensemble problem where each individual solution is a soft clustering. We connect it to the well-known discrete Wasserstein barycenter problem in geometry. Based on some novel geometric insights in high dimensions, we propose the sampling-based algorithms with provable quality guarantees. We also provide the systematical analysis on the consensus of our model. Finally, we conduct the experiments to evaluate our proposed algorithms.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringClustering Ensemble Ensemble Learning

Coarse-Grain Cluster Analysis of Tensors with Application to Climate Biome Identification

2020-01-22 · Derek DeSantis, Phillip J. Wolfram, Katrina Bennett, Boian Alexandrov

A tensor provides a concise way to codify the interdependence of complex data. Treating a tensor as a d-way array, each entry records the interaction between the different indices. Clustering provides a way to parse the …

Classification Clustering General Classification

Ultra-Scalable Spectral Clustering and Ensemble Clustering

2019-03-04 · Dong Huang, Chang-Dong Wang, Jian-Sheng Wu, Jian-Huang Lai 외

This paper focuses on scalability and robustness of spectral clustering for extremely large-scale datasets with limited resources. Two novel algorithms are proposed, namely, ultra-scalable spectral clustering (U-SPEC) an…

Clustering Image/Document Clustering

On Learning to Solve Cardinality Constrained Combinatorial Optimization in One-Shot: A Re-parameterization Approach via Gumbel-Sinkhorn-TopK

2021-09-29 · Runzhong Wang, Li Shen, Yiting Chen, Junchi Yan 외

Cardinality constrained combinatorial optimization requires selecting an optimal subset of $k$ elements, and it will be appealing to design data-driven algorithms that perform TopK selection over a probability distributi…

Combinatorial Optimization One-Shot Learning Self-Supervised Learning

Simple Deep Random Model Ensemble

2013-05-05 · Xiao-Lei Zhang, Ji Wu

Representation learning and unsupervised learning are two central topics of machine learning and signal processing. Deep learning is one of the most effective unsupervised representation learning approach. The main contr…

Clustering Clustering Ensemble Deep Learning Dictionary Learning+2

Backpropagation for Energy-Efficient Neuromorphic Computing

2015-12-01 · NeurIPS 2015 12 · Steve K. Esser, Rathinakumar Appuswamy, Paul Merolla, John V. Arthur 외

Solving real world problems with embedded neural networks requires both training algorithms that achieve high performance and compatible hardware that runs in real time while remaining energy efficient. For the former, d…