Complexity Study on Two Clustering Problems

Authors:
Louxin Zhang;Song Zhu
Affiliations:
Bioinformatics Lab, Kent Ridge Digital Labs, Singapore;Department of Mathematics & KRDL, National University of Singapore, Singapore 117543
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2009

Citing 0
Cited 2

A New Clustering Method for Microarray Data Analysis

CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Algorithmic and complexity issues of three clustering methods in microarray data analysis

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity issues of two clustering problems are studied. We prove that the Smooth Clustering and Biclustering problems are NP-hard; we also propose an 0.5 approximation algorithm and 0.8 inapproximability for a simplified clutering problem.