On the parameterized complexity of consensus clustering
type: Item
instance of: scholarly article
title: On the parameterized complexity of consensus clustering
zbMATH Open document ID: 1360.68506
author: Martin Dörnfelder
author: Jiong Guo
author: Christian Komusiewicz
author: Mathias Weller
published in: Theoretical Computer Science
publication date: 2014-06-23T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6306357
zbMATH Keywords: NP-hard problem
zbMATH Keywords: data clustering
zbMATH Keywords: search tree algorithm
zbMATH Keywords: local search
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.05.002
OpenAlex ID: W2029303541
cites work: Q4365126
cites work: Correlation clustering
cites work: Average parameterization and partial kernelization for computing medians
cites work: On the approximation of correlation clustering and consensus clustering
cites work: A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
cites work: Q5417662
cites work: Q4393480
cites work: Fundamentals of parameterized complexity
cites work: Local search: is brute-force avoidable?
cites work: Parametrized complexity theory.
cites work: The parameterized complexity of local search for TSP, more refined
cites work: Incremental list coloring of graphs, parameterized by conservation
cites work: Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
cites work: On Local Search and Placement of Meters in Networks
cites work: On the hardness of losing weight
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Searching the \(k\)-change neighborhood for TSP is W[1]-hard
cites work: Stable assignment with couples: parameterized complexity and local search
cites work: Theoretical aspects of local search.
cites work: Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
cites work: Q5710169
cites work: Cluster graph modification problems
cites work: 10.1162/153244303321897735
cites work: The complexity of computing medians of relations.
cites work: Advances in K-means Clustering
DOI: 10.1016/J.TCS.2014.05.002
description: scientific article; zbMATH DE number 6306357