Asymptotic Behavior of Mean Partitions in Consensus Clustering

2015-12-18 · Brijnesh Jain

Although consistency is a minimum requirement of any estimator, little is known about consistency of the mean partition approach in consensus clustering. This contribution studies the asymptotic behavior of mean partitions. We show that under normal assumptions, the mean partition approach is consistent and asymptotic normal. To derive both results, we represent partitions as points of some geometric space, called orbit space. Then we draw on results from the theory of Fr\'echet means and stochastic programming. The asymptotic properties hold for continuous extensions of standard cluster criteria (indices). The results justify consensus clustering using finite but sufficiently large sample sizes. Furthermore, the orbit space framework provides a mathematical foundation for studying further statistical, geometrical, and analytical properties of sets of partitions.

📄 PDF Abstract BibTeX arXiv:1512.06061

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Condorcet's Jury Theorem for Consensus Clustering and its Implications for Diversity

2016-04-26 · Brijnesh J. Jain

Condorcet's Jury Theorem has been invoked for ensemble classifiers to indicate that the combination of many classifiers can have better predictive performance than a single classifier. Such a theoretical underpinning is …

Clustering Diversity

ESDF: Ensemble Selection using Diversity and Frequency

2015-08-18 · Shouvick Mondal, Arko Banerjee

Recently ensemble selection for consensus clustering has emerged as a research problem in Machine Intelligence. Normally consensus clustering algorithms take into account the entire ensemble of clustering, where there is…

Clustering Diversity

Vertical Consensus Inference for High-Dimensional Random Partition

2026-03-29 · Khai Nguyen, Yang Ni, Peter Mueller arxiv

We review recently proposed Bayesian approaches for clustering high-dimensional data. After identifying the main limitations of available approaches, we introduce an alternative framework based on vertical consensus infe…

VertCoHiRF: Decentralized Vertical Clustering Beyond k-means

2026-02-07 · Bruno Belucci, Karim Lounici, Vladimir R. Kostic, Katia Meziani arxiv

Vertical Federated Learning (VFL) enables collaborative analysis across parties holding complementary feature views of the same samples, yet existing approaches are largely restricted to distributed variants of $k$-means…

Federated Learning

Determinantal consensus clustering

2021-02-07 · Serge Vicente, Alejandro Murua

Random restart of a given algorithm produces many partitions to yield a consensus clustering. Ensemble methods such as consensus clustering have been recognized as more robust approaches for data clustering than single c…

Clustering Clustering Ensemble Diversity Point Processes