A Note on Clustering Aggregation
arXiv: Computational Complexity, Volume abs/1807.08949, 2018.
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 ...More
Full Text (Upload PDF)
PPT (Upload PPT)