On Seeking Consensus Between Document Similarity Measures

02/13/2017
by   Mieczysław Kłopotek, et al.
0

This paper investigates the application of consensus clustering and meta-clustering to the set of all possible partitions of a data set. We show that when using a "complement" of Rand Index as a measure of cluster similarity, the total-separation partition, putting each element in a separate set, is chosen.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2023

Efficient Correlation Clustering Methods for Large Consensus Clustering Instances

Consensus clustering (or clustering aggregation) inputs k partitions of ...
research
06/29/2018

Comparing Graph Clusterings: Set partition measures vs. Graph-aware measures

In this paper, we propose a family of graph partition similarity measure...
research
12/18/2015

Asymptotic Behavior of Mean Partitions in Consensus Clustering

Although consistency is a minimum requirement of any estimator, little i...
research
06/02/2019

Comprehensive cluster validity Index based on structural simplicity

Nonhierarchical clustering depending on unsupervised algorithms may not ...
research
04/22/2016

The Mean Partition Theorem of Consensus Clustering

To devise efficient solutions for approximating a mean partition in cons...
research
01/04/2022

The cluster structure function

For each partition of a data set into a given number of parts there is a...
research
12/27/2022

Robust Consensus Clustering and its Applications for Advertising Forecasting

Consensus clustering aggregates partitions in order to find a better fit...

Please sign up or login with your details

Forgot password? Click here to reset