A Note on Clustering Aggregation

by   Jiehua Chen, et al.
Ben-Gurion University of the Negev

We consider the clustering aggregation problem in which we are given a set of clusterings and want to find an aggregated clustering which minimizes the sum of mismatches to the input clusterings. In the binary case (each clustering is a bipartition) this problem was known to be NP-hard under Turing reduction. We strengthen this result by providing a polynomial-time many-one reduction. Our result also implies that no 2^o(n)· |I|^O(1)-time algorithm exists for any clustering instance I with n elements, unless the Exponential Time Hypothesis fails. On the positive side, we show that the problem is fixed-parameter tractable with respect to the number of input clusterings.


page 1

page 2

page 3

page 4


On Computing Centroids According to the p-Norms of Hamming Distance Vectors

In this paper we consider the p-Norm Hamming Centroid problem which asks...

Approximating Length-Restricted Means under Dynamic Time Warping

We study variants of the mean problem under the p-Dynamic Time Warping (...

All non-trivial variants of 3-LDT are equivalent

The popular 3-SUM conjecture states that there is no strongly subquadrat...

On explicit reductions between two purely algebraic problems: MQ and MLD

The Maximum Likelihood Decoding Problem (MLD) and the Multivariate Quadr...

Conflict-based Force Aggregation

In this paper we present an application where we put together two method...

Clustering is Easy When ....What?

It is well known that most of the common clustering objectives are NP-ha...

Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant

We study the natural problem of Triplet Reconstruction (also Rooted Trip...

Please sign up or login with your details

Forgot password? Click here to reset