论文信息 - Cluster editing problem for points on the real line: A polynomial time algorithm

Cluster editing problem for points on the real line: A polynomial time algorithm

In this paper we consider the cluster editing problem for a special type of graphs, where the vertices represent points on the real line and there is an edge between each two vertices for which the distance between their corresponding points on the line is less than a given constant. We give a polynomial time cluster editing algorithm for this class of graphs.

Bassel Mannaa | B. Mannaa

[1] Ron Shamir,et al. Clustering Gene Expression Patterns , 1999, J. Comput. Biol..

[2] Roded Sharan,et al. Cluster graph modification problems , 2002, Discret. Appl. Math..

[3] Marcel R. Ackermann,et al. Clustering for metric and non-metric distance measures , 2008, SODA '08.

[4] Nir Ailon,et al. Aggregating inconsistent information: Ranking and clustering , 2008 .

[5] David P. Williamson,et al. Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems , 2007, WAOA.

[6] Sven Rahmann,et al. Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing , 2007, BMC Bioinformatics.

[7] Zohar Yakhini,et al. Clustering gene expression patterns , 1999, J. Comput. Biol..

[8] Peter Damaschke,et al. Fixed-Parameter Enumerability of Cluster Editing and Related Problems , 2010, Theory of Computing Systems.

[9] Jeffrey Scott Vitter,et al. Approximation Algorithms for Geometric Median Problems , 1992, Inf. Process. Lett..

[10] Rolf Niedermeier,et al. Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation , 2003, CIAC.

[11] Carla E. Brodley,et al. Feature Selection for Unsupervised Learning , 2004, J. Mach. Learn. Res..