Graph clustering

Computer Science Review

Volumn 1, Issue 1, 2007, Pages 27-64

  Schaeffer, Satu Elisa ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION AREA; CLUSTER ALGORITHMS; CLUSTER QUALITIES; GLOBAL ALGORITHMS; GRAPH CLUSTERING; GRAPH CLUSTERING ALGORITHMS; INPUT GRAPHS; LOCAL COMPUTATION;

GRAPH THEORY;

CLUSTERING ALGORITHMS;

EID: 35248893285     PISSN: 15740137     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cosrev.2007.05.001     Document Type: Article

References (249)

1. Drineas P., Frieze A., Kannan R., Vempala S., and Vinay V. Clustering in large graphs and matrices. Machine Learning 56 (2004) 9-33
2. Aarts E., and Lenstra J.K. Local Search in Combinatorial Optimization (1997), John Wiley & Sons, Inc., Chichester, UK
3. Achlioptas D., Clauset A., Kempe D., and Moore C. On the bias of traceroute sampling (or: Why almost every network looks like it has a power law). In: Gabow H.N., and Fagin R. (Eds). Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, STOC (2005), ACM Press, New York, NY, USA
4. Agarwal P.K., and Procopiuc C.M. Exact and approximation algorithms for clustering. Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (1998), ACM-SIAM, Philadelphia, PA, USA
5. Agrawal R., and Jagadish H.V. Algorithms for searching massive graphs. IEEE Transactions on Knowledge and Data Engineering 6 2 (1994) 225-238
6. D.J. Aldous, J.A. Fill, Reversibe Markov Chains and Random Walks on Graphs. http://www.stat.berkeley.edu/aldous/RWG/book.html, 2001 (in preparation)
7. Altaf-Ul-Amin M., Shinbo Y., Mihara K., Kurokawa K., and Kanaya S. Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC Bioinformatics 7 (2006) 207
8. ~ R.G., and Hu T. Multiterminal network flows. SIAM Journal 9 (1961) 551-570
9. Andersen R., Chung F.R.K., and Lang K. Local partitioning using PageRank vectors. Proceedings of the Fourty-seventh Annual Symposium on Foundations of Computer Science, FOCS (2006), IEEE Computer Society Press, Washington, DC, USA
10. Arora S., Rao S., and Vazirani U. Expander flows, geometric embeddings and graph partitioning. Proceedings of the Thirty-Sixth Annual Symposium on Theory of Computing, STOC (2004), ACM Press, New York, NY, USA
11. Asahiro Y., Hassin R., and Iwama K. Complexity of finding dense subgraphs. Discrete Applied Mathematics 121 1 (2002) 15-26
12. Auber D., Delest M., and Chiricota Y. Strahler based graph clustering using convolution. Proceedings of the Eighth International Conference on Information Visualisation (2004), IEEE Computer Society
13. Aurenhammer F. Voronoi diagrams - A survey of a fundamental geometric data structure. ACM Computing Surveys 23 3 (1991) 345-405
14. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti Spaccamela A., and Protasi M. Complexity and Approximation: Combinatorial optimization problems and their approximability properties (1999), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
15. F.R. Bach, M.I. Jordan, Learning spectral clustering, Tech. Rep. UCB/CSD-03-1249, Computer Science Division, University of California, Berkeley, CA, USA, Jun. 2003
16. G.D. Bader, C.W.V. Hogue, An automated method for finding molecular complexes in large protein interaction networks, BMC Bioinformatics 4(2)
17. Bagrow J.P., and Bollt E.M. Local method for detecting communities. Physical Review E 72 (2005) 046108
18. Bansal N., Blum A., and Chawla S. Correlation clustering. Machine Learning 56 1-3 (2004) 89-113
19. Bar-Ilan J., Kortsarz G., and Peleg D. How to allocate network centers. Journal of Algorithms 15 3 (1993) 385-415
20. Bar-Ilan J., Kortsarz G., and Peleg D. How to allocate network centers. Journal of Algorithms 15 3 (1993) 385-415
21. Bar-Ilan J., and Peleg D. Approximation algorithms for selecting network centers. In: Dehne F.K.H.A., Sack J.-R., and Santoro N. (Eds). Proceedings of the Second Workshop on Algorithms and Data Structures. WADS'91. Lecture Notes in Computer Science vol. 519 (1991), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
22. Barabási A.-L., and Albert R. Emergence of scaling in random networks. Science 286 5439 (1999) 509-512
23. Behrends E. Introduction to Markov Chains, with Special Emphasis on Rapid Mixing (2000), Vieweg & Sohn, Braunschweig, Wiesbaden, Germany
24. L.M.A. Bettencourt, Tipping the balances of a small world, Tech. Rep. MIT-CTP-3361 (cond-mat/0304321 at arXiv.org), Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA, USA, 2002
25. Biernacki C., Celeux G., and Govaert G. Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Transactions on Pattern Analysis and Machine Intelligence 22 7 (2000) 719-725
26. Biernacki C., and Govaert G. Using the classification likelihood to choose the number of clusters. Computing Science and Statistics 29 2 (1997) 451-457
27. Biggs N. Algebraic Graph Theory. 2nd ed. (1994), Cambridge University Press, Cambridge, UK
28. Bomze I.M., Budinich M., Pardalos P.M., and Pelillo M. The maximum clique problem. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization vol. Supplement Volume A (1999), Kluwer Academic Publishers, Boston, MA, USA 1-74
29. J.G. Booth, G. Casella, J.P. Hobert, Clustering using objective functions and stochastic search, Journal of the Royal Statistical Society, Series B (2007) (submitted for publication)
30. Boutin F., and Hascoet M. Cluster validity indices for graph partitioning. Proceedings of the Eighth International Conference on Information Visualisation (2004), IEEE Computer Society
31. Boyer F., Morgat A., Labarre L., Pothier J., and Viari A. Syntons, metabolons and interactons: An exact graph-theoretical approach for exploring neighbourhood between genomic and functional data. Bioinformatics 21 23 (2005) 4209-4215
32. Bradley P.S., Fayyad U.M., and Reina C. Scaling clustering algorithms to large databases. Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, KDD (1998), ACM, New York, NY, USA
33. Brandes U. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25 2 (2001) 163-177
34. Brandes U., Gaertler M., and Wagner D. Experiments on graph clustering algorithms. In: Di Battista G., and Zwick U. (Eds). Proceedings of the Eleventh European Symposium on Algorithms. Lecture Notes in Computer Science vol. 2832 (2003), Springer-Verlag GmbH, Heidelberg, Germany
35. Brin S., and Page L. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30 1-7 (1998) 107-117
36. Broder A.Z., Kumar S.R., Maghoul F., Raghavan P., Rajagopalan S., Stata R., Tomkins A., and Wiener J. Graph structure in the Web. Computer Networks 33 1-6 (2000) 309-320
37. Bui T.N., Leighton F.T., Chaudhuri S., and Sipser M. Graph bisection algorithms with good average case behavior. Combinatorica 7 2 (1987) 171-191
38. Bunke H., Foggia P., Guidobaldi C., and Vento M. Graph clustering using the weighted minimum common supergraph. In: Hancock E.R., and Vento M. (Eds). Proceedings of the Fourth IARP International Workshop on Graph Based Representations in Pattern Recognition. Lecture Notes in Computer Science vol. 2726 (2003), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
39. Campbell J.F. Hub location and the p-hub median problem. Operations Research 44 6 (1996) 923-935
40. Capoccia A., Servedioa V., Caldarellia G., and Colaiorib F. Detecting communities in large networks. Physica A: Statistical Mechanics and its Applications 352 2-4 (2005) 669-676
41. J.J.M. Carrasco, D.C. Fain, K.J. Lang, L. Zhukov, Clustering of bipartite advertiser-keyword graph, in: Proceedings of the Third IEEE International Conference on Data Mining, Workshop on Clustering Large Data Sets, 2003
42. Chakrabarti D., and Faloutsos C. Graph mining: Laws, generators, and algorithms. ACM Computing Surveys 38 1 (2006) Article No. 2
43. Charikar M., Chekuri C., Feder T., and Motwani R. Incremental clustering and dynamic information retrieval. In: Leighton F.T., and Shor P. (Eds). Proceedings of the Twenty-ninth Annual Symposium on Theory of Computing, STOC (1997), ACM Press, New York, NY, USA
44. Charikar M., and Panigrahy R. Clustering to minimize the sum of cluster diameters. Journal of Computer and System Sciences 68 2 (2004) 417-441
45. Cheeger J. A lower bound for the smallest eigenvalue of the laplacian. Problems in Analysis: Symposium in Honor of Salomon Bochner (1969) (1970), Princeton University Press, Princeton, NJ, USA
46. Chen N., Chen A., Zhou L., and Lu L. A graph-based clustering algorithm in large transaction databases. Intelligent Data Analysis 5 4 (2001) 327-338
47. D. Cheng, R. Kannan, S. Vempala, G. Wang, On a recursive spectral algorithm for clustering from pairwise similarities, Tech. Rep. MIT-LCS-TR-906, Laboratory of Computer Science, Massachusetts Institute of Technology, Boston, MA, USA, 2003
48. Cheng D., Vempala S., Kannan R., and Wang G. A divide-and-merge methodology for clustering. Proceedings of the Twenty-fourth Symposium on Principles of Database Systems (2005), ACM Press, New York, NY, USA
49. Chudak F.A., and Shmoys D.B. Improved approximation algorithms for the uncapacitated facility location problem. SIAM Journal on Computing 33 1 (2003) 1-25
50. Chun T.Y. World Wide Web robots: An overview. Online Information Review 22 3 (1999) 135-142
51. Chung F.R.K. Spectral Graph Theory (1997), American Mathematical Society, Providence, RI, USA
52. F.R.K. Chung, Random walks and local cuts in graphs, Linear Algebra and its Applications
53. Chung F.R.K., Lu L., and Vu V. The spectra of random graphs with given expected degrees. Internet Mathematics 1 3 (2004) 257-275
54. Clauset A. Finding local community structure in networks. Physical Review E 72 (2005) 026132
55. Clauset A., and Moore C. Accuracy and scaling phenomena in Internet mapping. Physical Review Letters 94 1 (2005) 018701
56. Clauset A., Newman M.E.J., and Moore C. Finding community structure in very large networks. Physical Review E 70 6 (2004) 066111
57. Cohen W.W., Ravikumar P., and Fienberg S.E. A comparison of string distance metrics for name-matching tasks. In: Kambhampati S., and Knoblock C.A. (Eds). Proceedings of IJCAI-03 Workshop on Information Integration on the Web, IIWeb-03 (2003), AAAI
58. Comellas F., and Gago Álvarez S. Spectral bounds for the betweenness of a graph. Linear Algebra and its Applications 423 1 (2007) 74-80
59. Condon A., and Karp R.M. Algorithms for graph partitioning on the planted partition model. Random Structures & Algorithms 18 2 (2001) 116-140
60. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. 2nd ed. (2001), MIT Press and McGraw Hill, Cambridge, MA, USA pp. 643-700
61. Cornuéjols G., Nemhauser G.L., and Wolsey L.A. The uncapacitated facility location problem. In: Mirchandani P.B., and Francis R.L. (Eds). Discrete Location Theory (1990), John Wiley and Sons, Inc., New York, NY, USA 119-171
62. P. Crescenzi, V. Kann, A compendium of np optimization problems. http://www.csc.kth.se/viggo/wwwcompendium/wwwcompendium.html, accessed on May 18, 2007
63. Cvetković D. Signless laplacians and line graphs, Bulletin, Classe des Sciences Mathématiques et Naturelles. Sciences mathématiques Académie Serbe des Sciences et des Arts CXXXI 30 (2005) 85-92
64. L. da F. Costa, F.A. Rodrigues, G. Travieso, P.R. Villas Boas, Characterization of complex networks: A survey of measurements, Tech. Rep. cond-mat/0505185 arXiv.org, May 2005
65. Dall'Asta L., Alvarez-Hamelin I., Barrat A., Vázquez A., and Vespignani A. Exploring networks with traceroute-like probes: Theory and simulations. Theoretical Computer Science 355 1 (2006) 6-24
66. Danon L., Díaz Guilera A., and Arenas A. The effect of size heterogeneity on community identification in complex networks. Journal of Statistical Mechanics Theory and Experiment (2006) P11010
67. Danon L., Díaz Guilera A., Duch J., and Arenas A. Comparing community structure identification. Journal of Statistical Mechanics Theory and Experiment (2005) P09008
68. Dave R.N., and Krishnapuram R. Robust clustering methods: A unified view. IEEE Transactions on Fuzzy Systems 5 2 (1997) 270-293
69. Davies D.L., and Bouldin D.W. A cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence 1 4 (1979) 224-227
70. de Abreu N.M.M. Old and new results on algebraic connectivity of graphs. Linear Algebra and its Applications 423 1 (2007) 53-73
71. Díaz J., Petit J., and Serna M. A survey of graph layout problems. ACM Computing Surveys 34 3 (2002) 313-356
72. Ding C., and He X. Linearized cluster assignment via spectral ordering. Proceedings of the Twenty-First International Conference on Machine Learning vol. 69 (2004), ACM Press, New York, NY, USA
73. Diwan A.A., Rane S., Seshadri S., and Sudarshan S. Clustering techniques for minimizing external path length. Proceedings of the Twenty-second International Conference on Very Large Data Bases (VLDB) (1996), Morgan Kaufmann Publishers, San Francisco, CA, USA
74. Donetti L., and Muñoz M.A. Detecting network communities: A new systematic and efficient algorithm. Journal of Statistical Mechanics (2004) P10012
75. Dong Y., Zhuang Y., Chen K., and Tai X. A hierarchical clustering algorithm based on fuzzy graph connectedness. Fuzzy Sets and Systems 157 13 (2006) 1760-1774
76. Dorogovtsev S.N., and Mendes J.F.F. Evolution of networks. Advances in Physics 51 4 (2002) 1079-1187
77. Doyle P.G., and Snell J.L. Random Walks and Electric Networks (1984), Mathematical Association of America, Washington, DC, USA
78. Du H. An algorithm for detecting community structure of social networks based on prior knowledge and modularity. Complexity 12 3 (2007) 53-60
79. Dubes R.C., and Jain A.K. Clustering methodologies in exploratory data analysis. Advances in Computers 19 (1980) 113-228
80. Dubhashi D.P., Laura L., and Panconesi A. Analysis and experimental evaluation of a simple algorithm for collaborative filtering in planted partition models. In: Pandya P.K., and Radhakrishnan J. (Eds). Proceedings of the Twenty-Third Conference on the Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science vol. 2914 (2003), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
81. Duda R.O., Hart P.E., and Stork D.G. Pattern Classification. 2nd ed. (2001), John Wiley & Sons, Inc., New York, NY, USA
82. Edachery J., Sen A., and Brandenburg F.J. Graph clustering using distance-k cliques. Proceedings of the Seventh International Symposium on Graph Drawing. Lecture Notes in Computer Science vol. 1731 (1999), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
83. Elias P., Feinstein A., and Shannon C.E. Note on maximum flow through a network. IRE Transactions on Information Theory IT-2 (1956) 117-119
84. Erdo{double acute}s P., and Rényi A. On random graphs I. Selected Papers of Alfréd Rényi vol. 2 (1976), Akadémiai Kiadó, Budapest, Hungary 308-315 First publication in Publ. Math. Debrecen 1959
85. Erdo{double acute}s P., and Rényi A. On the evolution of random graphs. Selected Papers of Alfréd Rényi vol. 2 (1976), Akadémiai Kiadó, Budapest, Hungary 482-525 First publication in MTA Mat. Kut. Int. Közl. 1960
86. Farkas I.J., Derényi I., Barabási A.-L., and Vicsek T. Spectra of "real-world" graphs: Beyond the semicircle law. Physical Review E 64 2 (2001) 026704
87. Farnstrom F., Lewis J., and Elkan C. Scalability for clustering algorithms revisited. SIGKDD Explorations 2 2 (2000) 1-7
88. Feder T., and Greene D.H. Optimal algorithms for approximate clustering. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC (1988), ACM Press, New York, NY, USA
89. Feige U., and Krauthgamer R. A polylogarithmic approximation of the minimum bisection. SIAM Journal on Computing 31 4 (2002) 1090-1118
90. Feige U., Peleg D., and Kortsarz G. The dense k-subgraph problem. Algoritmica 29 3 (2001) 410-421
91. Felner A. Finding optimal solutions to the graph partitioning problem with heuristic search. Annals of Mathematics and Artificial Intelligence 45 3-4 (2005) 292-322
92. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 23 (1973) 298-305
93. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal 25 (1975) 619-633
94. Flake G.W., Lawrence S., Giles C.L., and Coetzee F.M. Self-organization and identification of Web communities. IEEE Computer 35 3 (2002) 66-71
95. Flake G.W., Tarjan R.E., and Tsioutsiouliklis K. Graph clustering and minimum cut trees. Internet Mathematics 1 1 (2004) 385-408
96. Ford Jr. L.R., and Fulkerson D.R. Maximum flow through a network. Canadian Journal of Mathematics 8 (1956) 399-404
97. Fortunato S., Latora V., and Marchiori M. Method to find community structures based on information centrality. Physical Review E 70 (2004) 056104
98. Fraley C., and Raftery A.E. How many clusters? Which clustering method? Answers via model-based cluster analysis. The Computer Journal 41 8 (1998) 578-588
99. Fränti P., Virmajoki O., and Hautamäki V. Fast PNN-based clustering using k-nearest neighbor graph. IEEE Transactions on Pattern Analysis and Machine Intelligence 28 11 (2006) 1875-1881
100. Freeman L.C. A set of measures of centrality based upon betweenness. Sociometry 40 1 (1977) 35-41
101. T. Furuta, M. Sasaki, F. Ishizaki, A. Suzuki, H. Miyazawa, A new cluster formation method for sensor networks using facility location theory, Tech. Rep. NANZAN-TR-2006-01, Nanzan Academic Society Mathematical Sciences and Information Engineering, Nagoya, Japan, August 2006
102. Gallo G., Grigoriadis M.D., and Tarjan R.E. A fast parametric maximum flow algorithm and applications. SIAM Journal on Computing 18 1 (1989) 30-55
103. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, San Francisco, CA, USA
104. Garey M.R., Johnson D.S., and Stockmeyer L.J. Some simplified NP-complete graph problems. Theoretical Computer Science 1 3 (1976) 237-267
105. Gath I., and Geva A.B. Unsupervised optimal fuzzy clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 11 7 (1989) 773-780
106. Gilbert E.N. Random graphs. Annals of Mathematical Statistics 30 4 (1959) 1141-1144
107. Girvan M., and Newman M.E.J. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, USA 99 (2002) 8271-8276
108. Gkantsidis C., Mihail M., and Saberi A. Conductance and congestion in power law graphs. Proceedings of the International Conference on Measurement and Modeling of Computer Systems (2003), ACM Press, New York, NY, USA
109. Gkantsidis C., Mihail M., and Zegura E. Spectral analysis of Internet topologies. Proceedings of the Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM vol. 1 (2003), IEEE, New York, NY, USA
110. Goh K.-I., Kahng B., and Kim D. Spectra and eigenvectors of scale-free networks. Physical Review E 64 5 (2001) 051903
111. Goldberg A.V., and Tarjan R.E. A new approach to the maximum-flow problem. Journal of the ACM 35 4 (1988) 921-940
112. Gonzalez T.F. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38 (1985) 293-306
113. Grimmett G.R., and Stirzaker D.R. Probability and Random Processes. 3rd ed. (2001), Oxford University Press, Oxford, UK
114. Grout V., and Cunningham S. A constrained version of a clustering algorithm for switch placement and interconnection in large networks. In: Philip T. (Ed). Proceedings of the Nineteenth International Conference on Computer Applications in Industry and Engineering. CAINE (2006), ICSA
115. Guattery S., and Miller G.L. On the quality of spectral separators. SIAM Journal on Matrix Analysis and Applications 19 3 (1998) 701-719
116. Guha S., Mishra N., Motwani R., and O'Callaghan L. Clustering data streams. Proceedings of the Fourty-first Annual Symposium on Foundations of Computer Science. FOCS (2000), IEEE Computer Society Press, Los Alamitos, CA, USA
117. Guimerà R., Mossa S., Turtschi A., and Nunes Amaral L.A. The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles. Proceedings of the National Academy of Science of the United States of America 102 22 (2005) 7794-7799
118. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press, Cambridge, UK
119. Hartigan J.A., and Wong M.A. Algorithm AS 136: A k-means clustering algorithm. Applied Statistics 29 (1979) 100-108
120. Hartuv E., and Shamir R. A clustering algorithm based on graph connectivity. Information Processing Letters 76 4-6 (2000) 175-181
121. He X., Zha H., Ding C.H.Q., and Simon H.D. Web document clustering using hyperlink structures. Computational Statistics & Data Analysis 41 1 (2002) 19-45
122. Hennig C., and Hausdorf B. Design of dissimilarity measures: A new dissimilarity measure between species distribution ranges. In: Batagelj V., Bock H.-H., Ferligoj A., and Ziberna A. (Eds). Data Science and Classification, Studies in Classification, Data Analysis, and Knowledge Organization (2006), Springer-Verlag GmbH, Berlin, Germany 29-38
123. Higham D.J., Kalna G., and Kibble M. Spectral clustering and its use in bioinformatics. Journal of Computational and Applied Mathematics 204 1 (2007) 25-37
124. Hlaoui A., and Wang S. Median graph computation for graph clustering. Soft Computing - A Fusion of Foundations Methodologies and Applications 10 1 (2006) 47-53
125. Hochbaum D.D., and Shmoys D.B. A unified approach to approximation algorithms for bottleneck problems. Journal of the ACM 33 3 (1986) 533-550
126. Hochbaum D.S. Various notions of approximations: Good, better, best, and more. In: Hochbaum D.S. (Ed). Approximation Algorithms for NP-hard Problems (1997), PWS Publishing Company, Boston, MA, USA 346-398 (Chapter 9)
127. Holzapfel K., Kosub S., Maaß M.G., and Täubig H. The complexity of detecting fixed-density clusters. In: Petreschi R., Persiano G., and Silvestri R. (Eds). Proceedings of the Fifth Italian Conference on Algorithms and Complexity. CIAC. Lecture Notes in Computer Science vol. 2653 (2003), Springer-Verlag GmbH, Berlin, Germany
128. Hopcroft J.E., Khan O., Kulis B., and Selman B. Natural communities in large linked networks. Proceedings of the Ninth International Conference on Knowledge Discovery and Data Mining. KDD (2003), ACM, New York, NY, USA
129. Höppner F., Klawonn F., Kruse R., and Runkler T. Fuzzy Cluster Analysis: Methods for Classification, Data Analysis and Image Recognition (1999), John Wiley & Sons, Inc., Hoboken, NJ, USA
130. Hou T.-C., and Tsai T.-J. An access-based clustering protocol for multihop wireless ad hoc networks. IEEE Journal on Selected Areas in Communications 19 7 (2001) 1201-1210
131. Hsu W.-L., and Nemhauser G.L. Easy and hard bottleneck location problems. Discrete and Applied Mathematics 1 (1979) 209-216
132. Hu H., Yan X., Huang Y., Han J., and Zhou X.J. Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics Suppl. 1 (2005) 213-221
133. Jaccard P. Distribution de la flore alpine dans la Bassin de Dranses et dans quelques regions voisines. Bulletin del la Société Vaudoisedes Sciences Naturelles 37 (1901) 241-272 cited in [122]
134. Jain A.K., and Dubes R.C. Algorithms for Clustering Data (1988), Prentice-Hall, Englewood, NJ, USA
135. Jain A.K., Murty M.N., and Flynn P.J. Data clustering: A review. ACM Computing Surveys 31 3 (1999) 264-323
136. Jain K., and Vazirani V.V. Primal-dual approximation algorithms for metric facility location and k-median problems. Proceedings of the Fourtieth Annual Symposium on Foundations of Computer Science. FOCS (1999), IEEE Computer Society, Washington, DC, USA
137. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C. Optimization by simulated annealing: An experimental evaluation. Part I, graph partitioning. Operations Research 37 6 (1989) 865-892
138. Johnson E.J.L., Mehrotra A., and Nemhauser G.L. Min-cut clustering. Mathematical Programming 62 1 (1993) 133-151
139. Kahale N. A semidefinite bound for mixing rates of Markov chains. Random Structures and Algorithms 11 4 (1998) 299-313
140. Kalcsics J., Nickel S., and Schröder M. Toward a unified territorial design approach: Applications, algorithms, and GIS integration. TOP 13 1 (2005) 1-56
141. Kannan N., Selvaraj S., Gromiha M.M., and Vishveshwara S. Clusters in α / β barrel proteins: Implications for protein structure, function, and folding: A graph theoretical approach. Proteins 43 2 (2001) 103-112
142. Kannan R., Vempala S., and Vetta A. On clusterings - good, bad and spectral. Journal of the ACM 51 3 (2004) 497-515
143. Karp R.M. Reducibility among combinatorial problems. Proceedings of a Symposium on the Complexity of Computer Computations (1972), IBM, Plenum, NY, USA
144. Kempe D., and McSherry F. A decentralized algorithm for spectral analysis. In: Babai L. (Ed). Proceedings of the Thirty-sixth Annual Symposium on Theory of Computing. STOC (2004), ACM Press, New York, NY, USA
145. Kernighan B.W., and Lin S. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49 2 (1970) 291-308
146. Khuller S., and Sussmann Y.J. The capacitated k-center problem. In: Díaz J., and Serna M.J. (Eds). Proceedings of the Fourth Annual European Symposium on Algorithms. ESA. Lecture Notes in Computer Science vol. 1136 (1996), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
147. Kim S. Graph theoretic sequence clustering algorithms and their applications to genome comparison. In: Wang J.T.L., Wu C.H., and Wang P.P. (Eds). Computational Biology and Genome Informatics (2003), World Scientific Publishing Company 81-116 (Chapter 4)
148. King A.D., Przulj N., and Jurisica I. Protein complex prediction via cost-based clustering. Bioinformatics 20 17 (2004) 3013-3020
149. Klein R.W., and Dubes R.C. Experiments in projection and clustering by simulated annealing. Pattern Recognition 22 2 (1989) 213-220
150. Kleinberg J. An Impossibility Theorem for Clustering (2002), MIT Press, Cambridge, MA, USA
151. Kleinberg J.M., and Lawrence S. The structure of the Web. Science 294 5548 (2001) 1849-1850
152. Kleinberg J.M., and Tardos E. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. Journal of the ACM 49 5 (2002) 14-23
153. Klincewicz J.G. Heuristics for the p-hub location problem. European Journal of Operational Research 53 (1991) 25-37
154. Kozdron M. The discrete dirichlet problem (April 2000). http://citeseer.ist.psu.edu/293959.html
155. Kreher D.L., and Stinson D.R. Combinatorial Algorithms: Generation, Enumeration, and Search (1998), CRC Press, Boca Raton, FL, USA
156. Krishna P., Vaidya N.H., Chatterjee M., and Pradhan D.K. A cluster-based approach for routing in dynamic networks. ACM SIGCOMM Computer Communication Review 27 2 (1997) 49-64
157. Kumar S.R., Novak J., Raghavan P., and Tomkins A. On the bursty evolution of blogspace. Proceedings of the Twelfth International World-Wide Web Conference. WWW (2003), ACM Press, New York, NY, USA
158. Křivánek M., and Morávek J. NP-hard problems in hierarchical-tree clustering. Acta Informatica 23 3 (1986) 311-323
159. Lakroum S., Devlaminck V., Terrier P., Biela Enberg P., and Postaire J.-G. Clustering of the Poincare vectors. IEEE International Conference on Image Processing vol. 2 (2005), IEEE
160. Lang K., and Rao S. A flow-based method for improving the expansion or conductance of graph cuts. In: Nemhauser G.L., and Bienstock D. (Eds). Proceedings of the Tenth International Conference on Integer Programming and Combinatorial Optimization. IPCO. Lecture Notes in Computer Science vol. 3064 (2004), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
161. Latora V., and Marchiori M. Efficient behavior of small-world networks. Physical Review Letters 87 19 (2001) 198701
162. V. Latora, M. Marchiori, A measure of centrality based on the network efficiency, Tech. Rep. cond-mat/0402050, arXiv.org, February 2004
163. Lawler G.F. Intersections of Random Walks, Probability and its Applications (1991), Birkhäuser, Boston, MA, USA
164. Li R.-C. Accuracy of computed eigenvectors via optimizing a rayleigh quotient. Bit Numerical Mathematics 44 3 (2004) 585-593
165. Lin C.R., and Gerla M. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15 7 (1997) 1265-1275
166. Lipkus A.H. A proof of the triangle inequality for the tanimoto distance. Journal of Mathematical Chemistry 26 1-3 (1999) 263-265
167. Lovász L. Random walks on graphs: A survey. Bolyai Society Mathematical Studies, 2. Combinatorics, Pál Erdo{double acute}s is Eighty vol. 2 (1996), Bolyai Mathematical Society 353-397
168. Luo B., Wilson R.C., and Hancock E.R. Spectral feature vectors for graph clustering. In: Caelli T., Amin A., Duin R.P., Kamel M., and de Ridder D. (Eds). Proceedings of the Joint IARP International Workshops on Syntactical and Structural Pattern Recognition and Statistical Pattern Recognition. Lecture Notes in Computer Science vol. 2396 (2002), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
169. Luo B., Wilson R.C., and Hancock E.R. Spectral clustering of graphs. In: Goos G., Hartmanis J., and van Leeuwen J. (Eds). Proceedings of the Tenth International Conference on Computer Analysis of Images and Patterns. CAIP. Lecture Notes in Computer Science vol. 2756 (2003), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
170. R.M. MacGregor, On partitioning a graph: A theoretical and empirical study, Ph.D. Thesis, University of California, Berkeley, CA, USA, 1978
171. Matsuda H., Ishihara T., and Hashimoto A. Classifying molecular sequences using a linkage graph with their pairwise similarities. Theoretical Computer Science 210 2 (1999) 305-325
172. Matula D.W., and Shahrokhi F. Sparsest cuts and bottlenecks in graphs. Discrete Applied Mathematics 27 1-2 (1990) 113-123
173. McSherry F. Spectral partitioning of random graphs. Proceedings of the Fourty-Second IEEE Symposium on Foundations of Computer Science. FOCS (2001), IEEE Computer Society Press, Washington, DC, USA
174. F. McSherry, Spectral methods for data analysis, Ph.D. Thesis, University of Washington, Seattle, WA, USA, 2004
175. Meilǎ M., and Shi J. Learning segmentation by random walks. In: Leen T.K., Dietterich T.G., and Tresp V. (Eds). Advances in Neural Information Processing Systems 13. Papers from Neural Information Processing Systems, NIPS (2000), MIT Press, Cambridge, MA, USA
176. Meilǎ M., and Shi J. A random walks view of spectral segmentation. Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics (2001), Morgan Kauffman, San Francisco, CA, USA
177. Michalewicz Z., and Fogel D.B. How to Solve it: Modern Heuristics. 2nd ed. (2004), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
178. M. Mihail, C. Gkantsidis, A. Saberi, E. Zegura, On the semantics of internet topologies, Tech. Rep. GIT-CC-02-07, College of Computing, Georgia Institute of Technology, Atlanta, GA, USA, 2002
179. Milenova B.L., and Campos M.M. O-cluster: Scalable clustering of large high dimensional data sets. Proceedings of the IEEE International Conference on Data Mining. ICDM (2002)
180. Newman M.E. Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74 3 (2006) 036104
181. M.E.J. Newman, A measure of betweenness centrality based on random walks, Tech. Rep. cond-mat/0309045, arXiv.org, September 2003
182. Newman M.E.J. Properties of highly clustered networks. Physical Review E 68 2 (2003) 026121
183. Newman M.E.J. The structure and function of complex networks. SIAM Review 45 2 (2003) 167-256
184. Newman M.E.J. Detecting community structure in networks. The European Physical Journal B 38 2 (2004) 321-330
185. Newman M.E.J. Fast algorithm for detecting community structure in networks. Physical Review E 69 6 (2004) 066133
186. Newman M.E.J., and Girvan M. Mixing patterns and community structure in networks. In: Pastor-Satorras R., Rubi M., and Díaz Guilera A. (Eds). Statistical Mechanics of Complex Networks: Proceedings of the XVIII Sitges Conference on Statistical Mechanics. Lecture Notes in Physics vol. 625 (2003), Springer-Verlag GmbH, Berlin, Germany
187. Newman M.E.J., and Girvan M. Finding and evaluating community structure in networks. Physical Review E 69 2 (2004) 026113
188. Ng A.Y., Jordan M.I., and Weiss Y. On spectral clustering: Analysis and an algorithm. In: Dietterich T.G., Becker S., and Ghahramani Z. (Eds). Proceedings of the Fourteenth Conference on Advances in Neural Information Processing Systems, vol. 2 (2002), The MIT Press, Cambridge, MA, USA
189. O'Kelly M. A clustering approach to the planar hub location problem. Annals of Operations Research 40 1 (1992) 339-353
190. P. Orponen, S.E. Schaeffer, Locally computable approximations for spectral clustering and absorption times of random walks (in preparation)
191. Orponen P., and Schaeffer S.E. Local clustering of large graphs by approximate Fiedler vectors. In: Nikoletseas S. (Ed). Proceedings of the Fourth International Workshop on Efficient and Experimental Algorithms. WEA. Lecture Notes in Computer Science vol. 3505 (2005), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
192. Papadimitriou C.H. Computational Complexity (1993), Addison Wesley, Reading, MA, USA
193. Pereira-Leal J.B., Enright A.J., and Ouzounis C.A. Detection of functional modules from protein interaction networks. Proteins: Structure, Function, and Bioinformatics 54 1 (2003) 49-57
194. In: Perkins C.E. (Ed). Ad Hoc Networking (2001), Addison Wesley, Reading, MA, USA
195. Plesník J. A heuristic for the p-center problem in graphs. Discrete and Applied Mathematics 17 (1987) 263-268
196. Pothen A., Simon H.D., and Liou K.-P. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications 11 3 (1990) 430-452
197. Puhan J., Tuma T., and Fajfar I. Spice for Windows 95/98/NT. Elektrotehnišski vestnik 65 5 (1998) 267-271 Electrotechnical review, Ljubljana, Slovenia
198. Qiu H., and Hancock E.R. Graph matching and clustering using spectral partitions. Pattern Recognition 39 1 (2004) 22-34
199. Rabaey J.M. The spice circuit simulator, eECS Department of the University of California at Berkeley. http://bwrc.eecs.berkeley.edu/Classes/ICBook/SPICE/
200. Raghavan V.V., and Yu C.T. A comparison of the stability characteristics of some graph theoretic clustering methods. IEEE Transactions on Pattern Analysis and Machine Intelligence 3 4 (1981) 393-403
201. R.Z. Ríos-Mercado, E. Fernández, A reactive GRASP for a sales territory design problem with multiple balancing requirements, Tech. Rep. PISIS-2006-12, Graduate Program in Systems Engineering, Universidad Autónoma de Nuevo León, San Nicolás de los Garza, Mexico, September 2006
202. Robles-Kelly A., and Hancock E.R. Graph edit distance from spectral seriation. IEEE Transactions on Pattern Analysis and Machine Intelligence 27 3 (2005) 365-378
203. K.A. Rytkönen, A spring-force visualization algorithm implemented in Java (2003), unpublished
204. Saerens M., Fouss F., Yen L., and Dupont P. The principal components analysis of a graph, and its relationships to spectral clustering. In: Boulicaut J.-F., Esposito F., Giannotti F., and Pedreschi D. (Eds). Proceedings of the Fifteenth European Conference on Machine Learning. ECML. Lecture Notes in Computer Science (2004), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
205. Schaeffer S.E. Stochastic local clustering for massive graphs. In: Ho T.B., Cheung D., and Liu H. (Eds). Proceedings of the Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining. PAKDD. Lecture Notes in Computer Science vol. 3518 (2005), Springer-Velgar GmbH, Berlin, Heidelberg, Germany
206. S.E. Schaeffer, Algorithms for nonuniform networks, Ph.D. Thesis, Helsinki University of Technology, Espoo, Finland, April 2006
207. Schaeffer S.E., Marinoni S., Särelä M., and Nikander P. Dynamic local clustering for hierarchical ad hoc networks. Proceedings of the IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON'06, International Workshop on Wireless Ad-hoc and Sensor Networks, IWWAN'06, subtrack (2006), IEEE Communications Society, New York, NY, USA
208. Shamir R., Sharan R., and Tsur D. Cluster graph modification problems. Proceedings of the Twenty-eighth International Workshop on Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science vol. 2573 (2002), Springer-Verlag GmbH, Berlin, Germany
209. Shi J., and Malik J. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22 8 (2000) 888-901
210. Šíma J., and Schaeffer S.E. On the NP-completeness of some graph cluster measures. In: Wiedermann J., Tel G., Pokorný J., Bieliková M., and Štuller J. (Eds). Proceedings of the Thirty-second International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM. Lecture Notes in Computer Science vol. 3831 (2006), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
211. Sinclair A. Algorithms for Random Generation & Counting: A Markov Chain Approach (1993), Birkhäuser, Boston, MA, USA
212. Soumyanath K., and Deogun J.S. On bisection width of partial k-trees. Congressus Numerantium 74 (1990) 45-51
213. Spielman D.A., and Teng S.-H. Spectral partitioning works: Planar graphs and finite element meshes. Proceedings of the Thirty-seventh IEEE Symposium on Foundations of Computing. FOCS (1996), IEEE Computer Society Press, Los Alamitos, CA, USA
214. Spielman D.A., and Teng S.-H. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Babai L. (Ed). Proceedings of the Thirty-sixth Annual Symposium on Theory of Computing. STOC (2004), ACM Press, New York, NY, USA
215. Strunkov S.P. On weakly cospectral graphs, Mathematical Notes 80 4 (2006) 590-592 translated from Matematicheskie Zametki 80 (4) pp. 627-629
216. Sucec J., and Marsic I. Clustering Overhead for Hierarchical Routing in Mobile ad hoc Networks. Proceedings of the Twenty-first Annual Joint Conference of the IEEE Computer and Communications Societies vol. 3 (2002), IEEE Computer Society Press, Los Alamitos, CA, USA
217. Swamy C., and Shmoys D.B. Fault-tolerant facility location. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA (2003), ACM, SIAM
218. Świercz B., Starzak Ł., Zubert M., and Napieralski A. DMCS-SPICE circuit analysis. http://lux.dmcs.p.lodz.pl/~swierczu/java_gui.php
219. Tan P.-N., Steinbach M., and Kumar V. Cluster Analysis: Additional Issues and Algorithms (2005), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA pp. 569-650
220. T. Tanimoto, IBM Internal Report, November 17 1957
221. Thelwall M. A web crawler design for data mining. Journal of Information Science 27 5 (2001) 319-325
222. Toussaint G.T. Proximity graphs for nearest neighbor decision rules: Recent progress. Proceedings of the Thirty-Fourth Symposium on Computing and Statistics. Interface-2002 (2002), The Interface Foundation of North America, Fairfax Station, VA, USA
223. van Dam E.R., and Haemers W.H. Which graphs are determined by their spectrum?. Linear Algebra and its Applications 373 (2003) 241-272
224. S.M. van Dongen, Graph clustering by flow simulation, Ph.D. Thesis, Universiteit Utrecht, Utrecht, The Netherlands, May 2000
225. Vargas Suáarez L., Ríos-Mercado R.Z., and López F. Usando GRASP para resolver un problema de definición de territorios de atención comercial. In: Arenas M., Herrera F., Lozano M., Merelo J., Romero G., and Sáanchez A. (Eds). Proceedings of the IV Spanish Conference on Metaheuristics. Evolutionary and Bioinspired Algorithms vol. 2 (2005), Granada, Spain (in Spanish)
226. Vazirani V.V. Approximation Algorithms (2001), Springer-Verlag GmbH, Berlin, Germany
227. Virtanen S.E. Clustering the Chilean web. Proceedings of the First Latin American Web Congress. LAWEB (2003), IEEE Computer Society, Los Alamitos, CA, USA
228. S.E. Virtanen, Properties of nonuniform random graph models, Tech. Rep. HUT-TCS-A77, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2003
229. Vukadinović D., Huang P., and Erlebach T. On the spectrum and structure of Internet topology graphs. In: Unger H., Böhme T., and Mikler A.R. (Eds). Proceedings of Second International Workshop on Innovative Internet Computing Systems. Lecture Notes in Computer Science vol. 2346 (2002), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
230. Washio T., and Motoda H. Multi relational data mining (MRDM): State of the art of graph-based data mining. ACM SIGKDD Explorations Newsletter 5 1 (2003) 59-68
231. Watts D.J. Small Worlds (1999), Princeton University Press, Princeton, NJ, USA
232. R. Weber, P. Zezula, Is similarity search useful for high dimensional spaces? in: Proceedings of the Tenth International Workshop on Database and Expert Systems Applications, 1999
233. W.T. Williams, M.B. Dale, P. Macnaughton-Smith, An objective method of weighting in similarity analysis, Nature 201 (426)
234. Wilson R., Bai X., and Hancock E.R. Graph clustering using symmetric polynomials and local linear embedding. British Machine Vision Conference (2003)
235. Wong S.M., and Yao Y.Y. An information-theoretic measure of term specificity. Journal of the American Society for Information Science 43 1 (1992) 54-61
236. W.-C. Wong, A.W. Fu, Incremental document clustering for web page classification, in: J. Qun (Ed.), International Conference on Information Society in the 21st Century: Emerging Technologies and New Challenges, The University of Aizu, Aizu-Wakamatsu, Fukushima, Japan, 2000
237. Wu A.Y., Garland M., and Han J. Mining scale-free networks using geodesic clustering. In: Kim W., Kohavi R., Gehrke J., and DuMouchel W. (Eds). Proceedings of the Tenth International Conference on Knowledge Discovery and Data Mining. KDD (2004), ACM Press, New York, NY, USA
238. Wu F., and Huberman B.A. Finding communities in linear time: A physics approach. The European Physical Journal B 38 2 (2004) 331-338
239. Xie X.L., and Beni G. A validity measure for fuzzy clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 8 (1991) 841-847
240. Xu Y., Olman V., and Xu D. Clustering gene expression data using a graph-theoretic approach: An application of minimum spanning trees. Bioinformatics 18 4 (2002) 536-545
241. Yan J.-T., and Hsiao P.-Y. A new fuzzy-clustering-based approach for two-way circuit partitioning. Proceedings of the Eight International Conference on VLSI Design (1995), IEEE, New York, NY, USA
242. Yang B., and Liu J. An efficient probabilistic approach to network community mining. In: Yao J., Lingras P., Wu W.-Z., Szczuka M., Cercone N., and Slezak D. (Eds). Rough Sets and Knowledge Technology, Second International Conference. RSKT 2007, 14-16 May, Toronto, Canada. Lecture Notes in Computer Science vol. 4481 (2007) 267-275
243. Q. Yang, S. Lonardi, A parallel algorithm for clustering protein-protein interaction networks, in: Workshops and Poster Abstracts of the 2005 IEEE Computational Systems Bioinformatics Conference, 2005
244. Zachary W.W. An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33 (1977) 452-473
245. Zahn C.T. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers C-20 1 (1971) 68-86
246. Zaïane O.R., Foss A., Lee C.-H., and Wang W. On data clustering analysis: Scalability, constraints, and validation. Proceddings of the Sixth Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining. PAKDD. Lecture Notes in Computer Science vol. 2336 (2002), Springer-Verlag GmbH, Berlin, Heidelberg, Germany
247. H. Zanghi, C. Ambroise, V. Miele, Fast online graph clustering via Erdo{double acute}s-Rényi mixture, Tech. Rep. 8, Jouy-en-Josas/Paris/Evry, France, April 2007 (submitted for publication)
248. Zhong S., and Ghosh J. A unified framework for model-based clustering. Journal of Machine Learning Research 4 (2003) 1001-1037
249. Zoltners A.A., and Sinha P. Sales territory alignment: A review and model. Management Science 29 (1983) 1237-1256