Fixed-parameter algorithms for graph-modeled date clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5532 LNCS, Issue , 2009, Pages 39-48

  Guo, Jiong ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC TECHNIQUES; BOUNDED SEARCH; CLUSTERING PROBLEMS; CONCRETE APPLICATIONS; DATA CLUSTERING; FIXED-PARAMETER ALGORITHMS; NP-HARD; POLYNOMIAL-TIME; SUBGRAPHS;

COMPUTATIONAL COMPLEXITY;

CLUSTERING ALGORITHMS;

EID: 67650233250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02017-9_7     Document Type: Conference Paper

References (25)

1. Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 598-612. Springer, Heidelberg (2002)
2. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5), Article No. 23 (2008)
3. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1- 3), 89-113 (2004)
4. Betzler, N., Guo, J., Komusiewicz, C., Niedermeier, R.: Average parameterization for computing medians (submitted) (2009)
5. Böcker, S., Briesemeister, S., Bui, Q.B.A., Truβ, A.: Going weighted: Parameterized algorithms for cluster editing. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 1-12. Springer, Heidelberg (2008)
6. Böcker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: Evaluation and experiments. In: McGeoch, C.C. (ed.)WEA 2008. LNCS, vol. 5038, pp. 289-302. Springer, Heidelberg (2008)
7. Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C., Rosamond, F.A.: Clustering with partial information. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 144-155. Springer, Heidelberg (2008)
8. Bonizzoni, P., Vedova, G.D., Dondi, R., Jiang, T.: On the approximation of correlation clustering and consensus clustering. J. Comput. Syst. Sci. 74(5), 671-696 (2008)
9. Chesler, E.J., Lu, L., Shou, S., Qu, Y., Gu, J., Wang, J., Hsu, H.C., Mountz, J.D., Baldwin, N.E., Langston, M.A., Threadgill, D.W., Manly, K.F., Williams, R.W.: Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function. Nature Genetics 37(3), 233-242 (2005)
10. Dehne, F.K.H.A., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: Implementations and experiments. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 13-24. Springer, Heidelberg (2006)
11. Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Efficient parameterized preprocessing for Cluster Editing. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 312-321. Springer, Heidelberg (2007)
12. Fellows, M.R., Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Graphbased data clustering with overlaps (submitted) (2009)
13. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory Comput. Syst. 38(4), 373-392 (2005)
14. Guo, J.: A more effective linear kernelization for Cluster Editing. Theor. Comput. Sci. 410(8-10), 718-726 (2009)
15. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38(1), 31-45 (2007)
16. Guo, J., Kanj, I.A., Komusiewicz, C., Uhlmann, J.: Editing graphs into dense clusters (submitted) (2009)
17. Hüffner, F., Niedermeier, R., Wernicke, S.: Techniques for practical fixedparameter algorithms. The Computer Journal 51(1), 7-25 (2008)
18. Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. (to appear, 2009)
19. Kawaji, H., Takenaka, Y., Matsuda, H.: Graph-based clustering for finding distant relationships in a large set of protein sequences. Bioinformatics 20(2), 243-252 (2004)
20. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
21. Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. Journal of Mathematical Sociology 6, 139-154 (1978)
22. Seno, S., Teramoto, R., Takenaka, Y., Matsuda, H.: A method for clustering expression data based on graph structure. Genome Informatics 15(2), 151-160 (2004)
23. Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 144(1-2), 173-182 (2004)
24. Voy, B.H., Scharff, J.A., Perkins, A.D., Saxton, A.M., Borate, B., Chesler, E.J., Branstetter, L.K., Langston, M.A.: Extracting gene networks for low-dose radiation using grpah theoretical algorithms. PLoS Computational Biology 2(7), e89 (2006)
25. Yu, H., Paccanaro, A., Trifonov, V., Gerstein, M.: Predicting interactions in protein networks by completing defective cliques. Bioinformatics 22(7), 823-829 (2006)