A more relaxed model for graph-based data clustering: S-Plex editing

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

Volumn 5564 LNCS, Issue , 2009, Pages 226-239

  Guo, Jiong ^a   Komusiewicz, Christian ^a   Niedermeier, Rolf ^a   Uhlmann, Johannes ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED SEARCH; DATA CLUSTERING; EDGE MODIFICATION; EFFICIENT ALGORITHM; FORBIDDEN SUBGRAPH CHARACTERIZATIONS; GRAPH-BASED; INPUT DATAS; NP-HARD; PROBLEM KERNEL; VERTEX SET;

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA REDUCTION;

GRAPH THEORY;

EID: 70350686507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02158-9_20     Document Type: Conference Paper

References (17)

1. Balasundaram, B., Butenko, S., Hicks, I.V., Sachdeva, S.: Clique relaxations in social network analysis: The maximum k-plex problem (manuscript, 2006)
2. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1-3), 89-113 (2004)
3. 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)
4. 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)
5. 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)
6. Cook, V.J., Sun, S.J., Tapia, J., Muth, S.Q., Argüello, D.F., Lewis, B.L., Rothenberg, R.B., McElroy, P.D., The Network Analysis Project Team: Transmission network analysis in tuberculosis contact investigations. Journal of Infectious Diseases 196, 1517-1527 (2007)
7. Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Effcient parameterized preprocessing for cluster editing. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 312-321. Springer, Heidelberg (2007)
8. Guo, J.: A more effective linear kernelization for Cluster Editing. Theoretical Computer Science 410(8), 718-726 (2009)
9. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38(1), 31-45 (2007)
10. Komusiewicz, C., Hüffner, F., Moser, H., Niedermeier, R.: Isolation concepts for enumerating dense subgraphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 140-150. Springer, Heidelberg (2007)
11. Memon, N., Kristoffersen, K.C., Hicks, D.L., Larsen, H.L.: Detecting critical regions in covert networks: A case study of 9/11 terrorists network. In: Proc. 2nd ARES, pp. 861-870. IEEE Computer Society, Los Alamitos (2007)
12. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006)
13. Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. Journal of Mathematical Sociology 6, 139-154 (1978)
14. Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics 144(1-2), 173-182 (2004)
15. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146-160 (1972)
16. Xu, R., Wunsch II, D.: Survey of clustering algorithms. IEEE Transactions on Neural Networks 16(3), 645-678 (2005)
17. van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 260-273. Springer, Heidelberg (2008)