Clustering with partial information

Theoretical Computer Science

Volumn 411, Issue 7-9, 2010, Pages 1202-1211

  Bodlaender, Hans L ^a   Fellows, Michael R ^b   Heggernes, Pinar ^c   Mancini, Federico ^c   Papadopoulos, Charis ^c   Rosamond, Frances ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

Cluster editing; Graphs; Kernels; Parameterized algorithms

Indexed keywords

CLIQUE PARTITIONING; CORRELATION CLUSTERING; FIXED-PARAMETER TRACTABILITY; FUZZY GRAPH; INPUT GRAPHS; KERNELIZATION; MISSING INFORMATION; NP-HARD; PARAMETERIZED; PARAMETERIZED ALGORITHM; PARAMETERIZING; PARTIAL INFORMATION; POLYNOMIAL-TIME; POLYNOMIAL-TIME REDUCTION; PROBLEM KERNEL;

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; FUZZY SETS; GRAPH THEORY; MATHEMATICAL OPERATORS;

CLUSTERING ALGORITHMS;

EID: 74849122537     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.12.016     Document Type: Article

References (29)

1. Ailon N., Charikar M., and Newman A. Aggregating inconsistent information: Ranking and clustering. J. ACM 55 5 (2008)
2. N. Bansal, A. Blum, S. Chawla, Correlation clustering, in: Proceedings of FOCS 2002 - 43rd Symposium on Foundations of Computer Science, 2002, pp. 238-247
3. Bansal N., Blum A., and Chawla S. Correlation clustering. Mach. Learn. 56 1-3 (2004) 89-113
4. Ben-Dor A., Shamir R., and Yakhini Z. Clustering gene expression patterns. J. Comput. Biol. 6 3-4 (1999) 281-297
5. S. Böcker, S. Briesemeister, Q.B.A. Bui, A. Truss, Going weighted: Parameterized algorithms for cluster editing, Theoret. Comput. Sci., 2009 (in press)
6. Bodlaender H.L., Fellows M.R., Heggernes P., Mancini F., Papadopoulos C., and Rosamond F.A. Clustering with partial information. Proceedings of MFCS 2008 - 33rd International Symposium on Mathematical Foundations of Computer Science, vol. 5162 (2008), Springer 144-155
7. De Bruijin N.J., and Erdos P. On a combinatorial problem. Indag. Math. 10 (1948) 421-423
8. Cai L. Fixed-parameter tractability of graph modification problems for hereditary properties. Inform. Process. Lett. 58 4 (1996) 171-176
9. Charikar M., Guruswami V., and Wirth A. Clustering with qualitative information. J. Comput. Syst. Sci. 71 3 (2005) 360-383
10. Chen Z.-Z., Jiang T., and Lin G. Computing phylogenetic roots with bounded degrees and errors. SIAM J. Comput. 32 4 (2003) 864-879
11. Demaine E.D., Emanuel D., Fiat A., and Immorlica N. Correlation clustering in general weighted graphs. Theoret. Comput. Sci. 361 2-3 (2006) 172-187
12. E.D. Demaine, N. Immorlica, Correlation clustering with partial information, in: Proceedings of RANDOM-APPROX 2003 - 7th International Workshop on Randomization and Approximation Techniques in Computer Science, 2003, pp. 1-13
13. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
14. D. Emanuel, A. Fiat, Correlation clustering-minimizing disagreements on arbitrary weighted graphs, in: Proceedings of ESA 2003 - 11th Annual European Symposium on Algorithms, 2003, pp. 208-220
15. M.R. Fellows, M.A. Langston, F.A. Rosamond, P. Shaw, Efficient parameterized preprocessing for cluster editing, in: Proceedings of FCT 2007 - Fundamentals of Computation Theory, 16th International Symposium, 2007, pp. 312-321
16. M.R. Fellows, The lost continent of polynomial time: Preprocessing and kernelization, in: Proceedings of IWPEC 2006 - Parameterized and Exact Computation, Second International Workshop, 2006, pp. 276-277
17. Goldberg A.V. Recent developments in maximum flow algorithms (invited lecture). Proceedings of SWAT '98 - 6th Scandinavian Workshop on Algorithm Theory 1432 (1998) 1-10
18. Golumbic M.C., Kaplan H., and Shamir R. Graph sandwich problems. J. Algorithms 19 3 (1995) 449-473
19. Gramm J., Guo J., Hüffner F., and Niedermeier R. Graph-modeled data clustering: Exact algorithms for clique generation. Theory Comput. Syst. 38 4 (2005) 373-392
20. Guo J., and Niedermeier R. Invitation to data reduction and problem kernelization. SIGACT News 38 1 (2007) 31-45
21. J. Guo, A more effective linear kernelization for cluster editing, in: Proceedings of ESCAPE 2007 - Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, 2007, pp. 36-47
22. Krivánek M., and Morávek J. NP-hard problems in hierarchical-tree clustering. Acta Inf. 23 3 (1986) 311-323
23. Marx D. Parameterized graph separation problems. Proceedings of IWPEC'04 - 1st International Workshop on Parameterized and Exact Computation (2004), Springer 71-82
24. Ma S.H., Wallis W.D., and Wu J.L. The complexity of the clique partition number problem. Congr. Numer. 67 (1988) 59-66
25. E. Mujuni, F.A. Rosamond, Parameterized complexity of the clique partition problem, in: Proceedings of ACiD 2007 - 2nd Workshop of Algorithms and Complexity in Durham, 2007
26. Niedermeier R. Invitation to Fixed-Parameter Algorithms (2006), Oxford University Press
27. Orlin J. Contentment in graph theory: Covering graphs with cliques. Indag. Math. 39 (1977) 406-424
28. F. Protti, M.D. da Silva, J.L. Szwarcfiter, Applying modular decomposition to parameterized bicluster editing, in: Proceedings of IWPEC 2006 - Parameterized and Exact Computation, Second International Workshop, 2006, pp. 1-12
29. Shamir R., Sharan R., and Tsur D. Cluster graph modification problems. Discrete Appl. Math. 144 1-2 (2004) 173-182