Spectral methods for graph clustering - A survey

European Journal of Operational Research

Volumn 211, Issue 2, 2011, Pages 221-231

  Nascimento, Mariá C V ^a   De Carvalho, André C P L F ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Min cut; Modularity; ncut; Ratio cut; Spectral clustering

Indexed keywords

CLUSTER ANALYSIS; GRAPH THEORY; GRAPHIC METHODS; SURVEYS;

MIN-CUT; MODULARITY; NCUT; RATIO CUT; SPECTRAL CLUSTERING;

CLUSTERING ALGORITHMS;

EID: 79951677261     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.08.012     Document Type: Article

References (60)

1. Alpert, C.J., Kahng, A.B., 1994. Multi-way partitioning via spacefilling curves and dynamic programming. In: Proceeding of the 31st ACM/IEEE Design Automation Conference, pp. 652-657.
2. C. Alpert, A.B. Kahng, and S.Z. Yao Spectral partitioning with multiple eigenvect (Pubitemid 129550464)
3. Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., Croz, J.D., Greenbaum, A., Hammarling, S., Mckenney, A., Sorensen, D., 1990. LAPACK: A Portable Linear Algebra Library for High-Performance Computers, Technical Report CS-90-105, Computer Science Department, University of Tennessee, Knoxville, TN.
4. F.R. Bach, and M.I. Jordan Learning spectral clustering S. Thrun, L. Saul, B. Schölkopf, Advances in Neural Information Processing Systems vol. 16 2004 MIT Press Cambridge 305 312
5. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang Complex networks: Structure and dynamics Physics Reports 424 2006 175 308 (Pubitemid 43135890)
6. Brand, M., Huang, K., 2003. A unifying theorem for spectral embedding and clustering. In: Bishop, C., Frey, B. (Eds.), Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics.
7. P.K. Chan, M.D.F. Schlag, and J.Y. Zien Spectral k-way ratio-cut partitioning and clustering IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 13 1994 1088 1096
8. F.R.K. Chung Spectral graph theory No. 92 in CBMS Regional Conference Series in Mathematics 1994 American Mathematical Society
9. R.M. Cormack A review of classification Journal of the Royal Statistical Society 134 1971 321 367
10. D. Cvetković, M. Doob, and H. Sachs Spectra of Graphs: Theory and Application 1979 Academic Press New York
11. T. De Bie, and N. Cristianini Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems Journal of Machine Learning Research 7 2006 1409 1436 (Pubitemid 44024594)
12. R. Diestel Graph theory third ed. Graduate Texts in Mathematics vol. 173 2005 Springer-Verlag Heidelberg
13. Ding, C., He, X., Zha, H., Gu, M., Simon, H., 2001. A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings of the IEEE International Conference on Data Mining, ICDM 2001, pp. 107-114.
14. C. Ding, X. He, R.F. Meraz, and S.R. Holbrook A unified representation of multiprotein complex data for modeling interaction networks Proteins: Structure, Function, and Bioinformatics 57 2004 99 108 (Pubitemid 39195886)
15. C. Ding, X. He, and H.D. Simon Nonnegative Lagrangian relaxation of k-means and spectral clustering Machine Learning: ECML 2005 Lecture Notes in Computer Science 2005 Springer Berlin, Heidelberg 530 538
16. W. Donath, and A. Hoffman Lower bounds for the partitioning of graphs IBM Journal Research and Development 17 5 1973 420 425
17. M. Fiedler A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory Czechoslovak Mathematical Journal 25 1975 619 633
18. M. Filippone, F. Camastra, F. Masulli, and S. Rovetta A survey of kernel and spectral methods for clustering Pattern Recognition 41 2008 176 190 (Pubitemid 47284212)
19. L.R. Ford Jr., and D.R. Fulkerson Flows in Networks 1962 Princeton University Press Princeton
20. J.J. Forman, P.A. Clemons, S.L. Schreiber, and S.J. Haggarty SpectralNET - An application for spectral graph analysis and visualization BMC Bioinformatics 6 2005 260
21. C. Fowlkes, S. Belongie, F. Chung, and J. Malik Spectral grouping using the Nyström method IEEE Transactions on Pattern Analysis and Machine Intelligence 26 2004 214 225
22. P. Gleiser, and L. Danon Community structure in jazz Advances in Complex Systems 6 2003 565 573
23. Gu, M., Zha, H., Ding, C., He, X., Simon, H., 2001. Spectral Relaxation Models and Structure Analysis for k-way Graph Clustering and Bi-clustering, Technical Report. CSE-01-007, The Pennsylvania State University.
24. L. Hagen, and A. Kahng New spectral methods for ratio cut partitioning and clustering IEEE Transactions on Computer-Aided Design 11 1992 1074 1088
25. K.M. Hall An r-dimensional quadratic placement algorithm Management Science 17 1970 219 229
26. P. Hansen, and B. Jaumard Cluster analysis and mathematical programming Mathematical Programming 79 1997 191 215 (Pubitemid 127397727)
27. E. Hückel Quantentheoretische Beiträge zum Benzolproblem Zeitschrift füur Physik a Hadrons and Nuclei 72 1931 310 337
28. C. Huttenhower, A.I. Flamholz, J.N. Landis, S. Sahi, C.L. Myers, K.L. Olszewski, M.A. Hibbs, N.O. Siemers, O.G. Troyanskaya, and H.A. Coller Nearest neighbor networks: Clustering expression data based on gene neighborhoods BMC Bioinformatics 8 2007 250
29. N. Kannan, and S. Vishveshwara Identification of side-chain clusters in protein structures by a graph spectral method Journal of Molecular Biology 292 1999 441 464 (Pubitemid 29435778)
30. J. Kim, and S. Choi Semidefinite spectral clustering Pattern Recognition 39 11 2006 2025 2035 (Pubitemid 44175463)
31. Kulis, B., Surendran, A.C., Platt, J.C., 2007. Fast low-rank semidefinite programming for embedding and clustering. In: Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics.
32. Leighton, T., Rao, S., 1988. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 422-431.
33. B. Luo, R.C. Wilson, and E.R. Hancock Spectral embedding of graphs Pattern Recognition 36 2003 2213 2230 (Pubitemid 36947209)
34. D. Lusseau, K. Schneider, O.J. Boisseau, P. Haase, E. Slooten, and S.M. Dawson The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations Behavioral Ecology and Sociobiology 54 2003 396 405 (Pubitemid 37144024)
35. Maier, M., von Luxburg, U., Hein, M., 2009. Influence of graph construction on graph-based clustering measures. In: Koller, D., Schuurmans, D., Bengio, Y., Bottou, L., Curran, Hook, R. (Eds.), Advances in Neural Information Processing Systems, vol. 21, pp. 1025-1032.
36. Meil, M., Shi, J., 2001. A random walks view of spectral segmentation. In: Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics.
37. Meil, M., Xu, L., 2004. Multiway Cuts and Spectral Clustering, Technical Report. 442, University of Washington.
38. B. Mohar The Laplacian spectrum of graphs Graph Theory, Combinatorics, and Applications 2 1991 871 898
39. M.E.J. Newman Finding community structure in networks using the eigenvectors of matrices Physical Review E 74 2006 036 104
40. M.E.J. Newman, and M. Girvan Finding and evaluating community structure in networks Physical Review E 69 2004 026113
41. A. Ng, M. Jordan, and Y. Weiss On spectral clustering: Analysis and an algorithm T.G. Dietterich, S. Becker, Z. Ghahramani, Advances in Neural Information Processing Systems vol. 14 2002 MIT Press Cambridge, MA 849 856
42. Saerens, M., Fouss, F., Yen, L., Dupont, P., 2004. The principal components analysis of a graph, and its relationships to spectral clustering. In: Machine Learning: ECML 2004, Lecture Notes in Computer Science, vol. 3201, pp. 371-383. (Pubitemid 41050106)
43. S.E. Schaeffer Graph clustering Computer Science Review 1 2007 27 64
44. A. Schrijver Combinatorial Optimization Polyhedra and Efficiency vol. B 2003 Springer-Verlag Berlin, Heidelberg
45. Shi, J., Malik, J., 1997. Normalized cuts and image segmentation. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 731-737.
46. J. Shi, and J. Malik Normalized cuts and image segmentation IEEE Transactions on Pattern Analysis and Machine Intelligence 22 2000 888 905
47. V. Singh, L. Mukherjee, J. Peng, and J. Xu Ensemble clustering using semidefinite programming J. Platt, D. Koller, Y. Singer, S. Roweis, Advances in Neural Information Processing Systems vol. 20 2008 MIT Press Cambridge, MA 1353 1360
48. G.W. Stewart, and J. Sun Matrix Perturbation Theory Computer Science and Scientific Computing 1990 Academic Press
49. Ushioda, A., Kawasaki, J., 1996. Hierarchical clustering of words and application to nlp tasks. In: Ejerhed, E., Dagan, I. (Eds.), Fourth Workshop on Very Large Corpora. Association for Computational Linguistics, Somerset, New Jersey. pp. 28-41.
50. Venables, W.N., Smith, D.M., 2010. An Introduction to R. R Development Core Team, The R Foundation for Statistical Computing, version 2.11.1.
51. U. Von Luxburg A tutorial on spectral clustering Statistics and Computing 17 4 2007 395 416
52. U. Von Luxburg, M. Belkin, and O. Bousquet Consistency of spectral clustering The Annals of Statistics 36 2008 555 586
53. Wei, Y. C., Cheng, C. K., 1989. Towards efficient hierarchical designs by ratio cut partitioning. In: Proceedings of the IEEE International Conference on Computer-Aided Design. pp. 298-301.
54. S.D.M. White, and C.S. Frenk Galaxy formation through hierarchical clustering Astrophysical Journal 379 Part 1 1991 52 79
55. Z. Wu, and R. Leahy An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation IEEE Transactions on Pattern Analysis and Machine Intelligence 15 11 1993 1101 1113
56. Xing, E., Jordan, M., 2003. On semidefinite relaxation for normalized k-cut and connections to spectral clustering, Technical Report. CSD-03-1265, University of California, Berkeley.
57. Yu, S.X., Shi, J., 2003. Multiclass spectral clustering. In: Proceedings of the Ninth IEEE International Conference on Computer Vision, pp. 313-319.
58. W. Zachary An information flow model for conflict and fission in small groups Journal of Anthropological Research 33 1977 452 473
59. L. Zelnik-Manor, and P. Perona Self-tuning spectral clustering Advances in Neural Information Processing Systems vol. 17 2004 MIT Press 1601 1608
60. Zha, H., Ding, C., Gu, M., He, X., Simon, H., 2002. Spectral relaxation for k-means clustering. In: Advances in Neural Information Processing Systems, vol. 14. pp. 1057-1064.