Graph-based data clustering with overlaps
Authors:
- Michael R. FellowsMFMichael R. Fellows
- Jiong GuoJGJiong Guo
- Christian KomusiewiczCKChristian Komusiewicz
- Rolf NiedermeierRNRolf Niedermeier
- Johannes UhlmannJUJohannes Uhlmann
- 1 February 2011
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 8 (1) , 2-17
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A more effective linear kernelization for cluster editingTheoretical Computer Science, 2009
- Fixed-Parameter Enumerability of Cluster Editing and Related ProblemsTheory of Computing Systems, 2008
- Graph clusteringComputer Science Review, 2007
- Applying Modular Decomposition to Parameterized Cluster Editing ProblemsTheory of Computing Systems, 2007
- Survey of Clustering AlgorithmsIEEE Transactions on Neural Networks, 2005
- Graph-Modeled Data Clustering: Exact Algorithms for Clique GenerationTheory of Computing Systems, 2005
- Cluster graph modification problemsDiscrete Applied Mathematics, 2004
- CLICK and EXPANDER: a system for clustering and visualizing gene expression dataBioinformatics, 2003
- Clustering Gene Expression PatternsJournal of Computational Biology, 1999
- An optimal graph theoretic approach to data clustering: theory and its application to image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1993