Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation
We present efficient fixed-parameter algorithms for the NP-complete edge modification problems Cluster Editing and Cluster Deletion. Here, the goal is to make the fewest changes to the edge set of an input graph such that the new graph is a vertex-disjoint union of cliques. Allowing up to k edge additions and deletions (Cluster Editing), we solve this problem in O(2.27k + |V|3) time; allowing only up to k edge deletions (Cluster Deletion), we solve this problem in O(1.77k + |V|3) time. The key ingredients of our algorithms are two easy to implement bounded search tree algorithms and a reduction to a problem kernel of size O(k 3). This improves and complements previous work.
KeywordsNP-complete problems edge modification problems data clustering fixed-parameter tractability exact algorithms
Unable to display preview. Download preview PDF.
- 5.R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer. 1999.Google Scholar
- 7.J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Automated generation of search tree algorithms for graph modification problems. Manuscript in preparation, March 2003.Google Scholar
- 9.A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice Hall, 1988.Google Scholar
- 16.R. Niedermeier and P. Rossmanith. On efficient fixed-parameter algorithms for Weighted Vertex Cover. Journal of Algorithms, to appear, 2003.Google Scholar
- 17.R. Shamir, R. Sharan, and D. Tsur. Cluster graph modification problems. In Proc. of 28th WG, number 2573 in LNCS, pages 379–390, 2002, Springer.Google Scholar
- 18.R. Sharan and R. Shamir. CLICK: A clustering algorithm with applications to gene expression analysis. In Proc. of 8th ISMB, pp. 307–316, 2000. AAAI Press.Google Scholar
- 19.R. Sharan and R. Shamir. Algorithmic approaches to clustering gene expression data. In T. Jiang et al. (eds): Current Topics in Computational Molecular Biology, pages 269–300, The MIT Press. 2002.Google Scholar