The DOI matches its Crossref record; 167 of the 167 references it cites were found in a registry or an index.
Graph clustering
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Davies, D. L., & Bouldin, D. W. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766909 · Cited by 9,145
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Bollobás, B. (1985) · Cited by 6,196
An automated method for finding molecular complexes in large protein interaction networks
Bader, G. D., & Hogue, C. W. (2003) · BMC Bioinformatics · doi:10.1186/1471-2105-4-2 · Cited by 6,072
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Fast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Efficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
Finding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.74.036104 · Cited by 4,761
An Information Flow Model for Conflict and Fission in Small Groups
Zachary, W. W. (1977) · Journal of Anthropological Research · doi:10.1086/jar.33.4.3629752 · Cited by 4,704
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
A validity measure for fuzzy clustering
Xie, X. L., & Beni, G. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.85677 · Cited by 3,385
(2011) · SpringerReference · doi:10.1007/springerreference_57547 · Cited by 3,190
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Advances in neural information processing systems 11
Peter Sollich, A. (1999) · Cited by 3,168
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
Comparing community structure identification
Danon, L., Díaz-Guilera, A., Duch, J., & Arenas, A. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09008 · Cited by 2,872
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
Fraley, C. (1998) · The Computer Journal · doi:10.1093/comjnl/41.8.578 · Cited by 2,549
Characterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (1956) · Canadian Journal of Mathematics · doi:10.4153/cjm-1956-045-5 · Cited by 2,410
How to Solve It: Modern Heuristics
Michalewicz, Z., & Fogel, D. B. (2000) · Springer eBooks · doi:10.1007/978-3-662-04131-4 · Cited by 2,207
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
Local Search in Combinatorial Optimization
(2003) · Princeton University Press eBooks · doi:10.1515/9780691187563 · Cited by 2,057
Detecting community structure in networks
Newman, M. E. J. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00124-y · Cited by 2,028
Perkins, C. E. (2008) · Cited by 1,889
A new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
Probability and Random Processes.
Grimmett, G. R., & Stirzaker, D. R. (2001) · doi:10.1093/oso/9780198572237.001.0001 · Cited by 1,850
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_15 · Cited by 1,829
Guimerà, R., Mossa, S., Turtschi, A., & Amaral, L. A. N. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407994102 · Cited by 1,762
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
Unsupervised optimal fuzzy clustering
Gath, I., & Geva, A. B. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.192473 · Cited by 1,640
Graph Clustering by Flow Simulation
van Dongen, S. M. (2000) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 1,595
Assessing a mixture model for clustering with the integrated completed likelihood
Biernacki, C., Celeux, G., & Govaert, G. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.865189 · Cited by 1,535
Adaptive clustering for mobile wireless networks
Lin, C. R., & Gerla, M. (1997) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.622910 · Cited by 1,533
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
Sarker, B. R. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90179-y · Cited by 1,284
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90183-4 · Cited by 1,263
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Gilbert, E. N. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706098 · Cited by 1,122
Bansal, N., Blum, A., & Chawla, S. (2004) · Machine Learning · doi:10.1023/b:mach.0000033116.57574.95 · Cited by 1,075
Random Walks and Electric Networks
Doyle, P., & Snell, J. (1984) · Carus Mathematical Monographs · doi:10.5948/upo9781614440222 · Cited by 1,061
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Fiedler, M. (1975) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1975.101357 · Cited by 1,042
Self-organization and identification of Web communities
Flake, G. W., Lawrence, S., Giles, C. L., & Coetzee, F. M. (2002) · Computer · doi:10.1109/2.989932 · Cited by 1,018
Local Graph Partitioning using PageRank Vectors
Andersen, R., Chung, F., & Lang, K. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.44 · Cited by 967
Fuzzy Cluster Analysis: Methods for Classification, Data Analysis and Image Recognition
Rayward-Smith, V. J., Höppner, F., Klawonn, F., Kruse, R., & Runkler, T. A. (2000) · Journal of the Operational Research Society · doi:10.2307/254022 · Cited by 922
On clusterings: Good, bad and spectral
Kannan, R., Vempala, S., & Vetta, A. (2004) · Journal of the ACM · doi:10.1145/990308.990313 · Cited by 834
(2018) · Optimization Models · doi:10.1017/cbo9781107279667.013 · Cited by 818
Finding local community structure in networks
Clauset, A. (2005) · Physical Review E · doi:10.1103/physreve.72.026132 · Cited by 788
Spielman, D. A., & Teng, S.-H. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007372 · Cited by 769
Proceedings 2001 IEEE International Conference on Data Mining
(2001) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989492 · Cited by 768
Scaling clustering algorithms to large databases
Bradley, P., Fayyad, U. M., & Reina, C. (1998) · Cited by 716
British Machine Vision Conference 2000
Mirmehdi, M. (2002) · Image and Vision Computing · doi:10.1016/s0262-8856(02)00048-3 · Cited by 716
Robust clustering methods: a unified view
Dave, R. N., & Krishnapuram, R. (1997) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.580801 · Cited by 711
Protein complex prediction via cost-based clustering
King, A. D., Pržulj, N., & Jurisica, I. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth351 · Cited by 666
Which graphs are determined by their spectrum?
van Dam, E. R., & Haemers, W. H. (2003) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(03)00483-x · Cited by 654
A Random Walks View of Spectral Segmentation.
Meilă, M., & Shi, J. (2001) · Cited by 623
Guha, S., Mishra, N., Motwani, R., & O'Callaghan, L. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892124 · Cited by 623
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
A survey of graph layout problems
Díaz, J., Petit, J., & Serna, M. (2002) · ACM Computing Surveys · doi:10.1145/568522.568523 · Cited by 599
Feige, U., Peleg, D., & Kortsarz, G. (2001) · Algorithmica · doi:10.1007/s004530010050 · Cited by 592
Spectral partitioning of random graphs
McSherry, F. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959929 · Cited by 584
Korte, B., & Vygen, J. (2000) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21708-5_16 · Cited by 579
On the bursty evolution of blogspace
Kumar, R., Novak, J., Raghavan, P., & Tomkins, A. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775233 · Cited by 553
(2002) · Cited by 542
The uncapacitated facility location problem
Cornuéjols, G., Nemhauser, G. L., & Wolsey, L. A. (1990) · Cited by 536
Spectra of “real-world” graphs: Beyond the semicircle law
Farkas, I. J., Derényi, I., Barabási, A.-L., & Vicsek, T. (2001) · Physical Review E · doi:10.1103/physreve.64.026704 · Cited by 499
Altaf-Ul-Amin, M., Shinbo, Y., Mihara, K., Kurokawa, K., & Kanaya, S. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-207 · Cited by 495
Properties of highly clustered networks
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.68.026121 · Cited by 493
Bach, F., & Jordan, M. I. (2003) · UC Berkeley · Cited by 493
Clustering Large Graphs via the Singular Value Decomposition
Petros Drineas, B., FRIEZE, A. M., Kannan, R., Vempala, S., & Vinay, V. (2004) · Machine Learning · doi:10.1023/b:mach.0000033113.59016.96 · Cited by 487
A clustering algorithm based on graph connectivity
Hartuv, E., & Shamir, R. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00142-3 · Cited by 480
A note on the maximum flow through a network
Elias, P., Feinstein, A., & Shannon, C. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056816 · Cited by 456
Finding communities in linear time: a physics approach
Wu, F., & Huberman, B. A. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00125-x · Cited by 451
State of the art of graph-based data mining
Washio, T., & Motoda, H. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959249 · Cited by 448
Detection of functional modules from protein interaction networks
Pereira‐Leal, J. B., Enright, A. J., & Ouzounis, C. A. (2004) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10505 · Cited by 441
Optimal algorithms for approximate clustering
Feder, T., & Greene, D. (1988) · doi:10.1145/62212.62255 · Cited by 437
Algorithms for graph partitioning on the planted partition model
Condon, A., & Karp, R. M. (2001) · Random Structures and Algorithms · doi:10.1002/1098-2418(200103)18:2<116::aid-rsa1001>3.0.co;2-2 · Cited by 429
A Fast Parametric Maximum Flow Algorithm and Applications
Gallo, G., Grigoriadis, M. D., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218003 · Cited by 427
Kleinberg, J., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/585265.585268 · Cited by 400
Spectral partitioning works: planar graphs and finite element meshes
Spielman, D. A., & Teng, S.-H. (1996) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548468 · Cited by 393
Algorithms for Random Generation and Counting: A Markov Chain Approach
Sinclair, A. (1993) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0323-0 · Cited by 380
Detecting network communities: a new systematic and efficient algorithm
Donetti, L., & Muñoz, M. A. (2004) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2004/10/p10012 · Cited by 374
Learning Segmentation by Random Walks
Meilă, M., & Shi, J. (2000) · neural information processing systems · Cited by 365
Incremental clustering and dynamic information retrieval
Charikar, M., Chekuri, C., Feder, T., & Motwani, R. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258657 · Cited by 354
Graph Clustering and Minimum Cut Trees
Flake, G. W., Tarjan, R. E., & Tsioutsiouliklis, K. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129093 · Cited by 333
Mining coherent dense subgraphs across massive biological networks for functional discovery
Hu, H., Yan, X., Huang, Y., Han, J., & Zhou, X. J. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1049 · Cited by 333
Detecting communities in large networks
Capocci, A., Servedio, V. D. P., Caldarelli, G., & Colaiori, F. (2005) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.12.050 · Cited by 329
Graph bisection algorithms with good average case behavior
Bui, T. N., Chaudhuri, S., Leighton, F. T., & Sipser, M. (1987) · Combinatorica · doi:10.1007/bf02579448 · Cited by 323
Kleinberg, J., & Lawrence, S. (2001) · Science · doi:10.1126/science.1067014 · Cited by 320
Experiments on Graph Clustering Algorithms
Brandes, U., Gaertler, M., & Wagner, D. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39658-1_52 · Cited by 317
Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph
Fränti, P., Virmajoki, O., & Hautamäki, V. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.227 · Cited by 310
Expander flows, geometric embeddings and graph partitioning
Arora, S., Rao, S., & Vazirani, U. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007355 · Cited by 297
Xu, Y., Olman, V., & Xu, D. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.4.536 · Cited by 295
Method to find community structures based on information centrality
Fortunato, S., Latora, V., & Marchiori, M. (2004) · Physical Review E · doi:10.1103/physreve.70.056104 · Cited by 294
Clustering Methodologies in Exploratory Data Analysis
Dubes, R., & Jain, A. K. (1980) · Advances in Computers · doi:10.1016/s0065-2458(08)60034-0 · Cited by 286
Local method for detecting communities
Bagrow, J. P., & Bollt, E. M. (2005) · Physical Review E · doi:10.1103/physreve.72.046108 · Cited by 283
Spectra and eigenvectors of scale-free networks
Goh, K.-I., Kahng, B., & Kim, D. (2001) · Physical Review E · doi:10.1103/physreve.64.051903 · Cited by 236
The effect of size heterogeneity on community identification in complex networks
Danon, L., Díaz-Guilera, A., & Arenas, A. (2006) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2006/11/p11010 · Cited by 234
A proof of the triangle inequality for the Tanimoto distance
Lipkus, A. H. (1999) · Journal of Mathematical Chemistry · doi:10.1023/a:1019154432472 · Cited by 230
Johnson, E. L., Mehrotra, A., & Nemhauser, G. L. (1993) · Mathematical Programming · doi:10.1007/bf01585164 · Cited by 225
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
Saerens, M., Fouss, F., Yen, L., & Dupont, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30115-8_35 · Cited by 219
Easy and hard bottleneck location problems
Hsu, W.-L., & Nemhauser, G. L. (1979) · Discrete Applied Mathematics · doi:10.1016/0166-218x(79)90044-1 · Cited by 215
The Spectra of Random Graphs with Given Expected Degrees
Chung, F., Lu, L., & Vu, V. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129089 · Cited by 207
A web crawler design for data mining
Thelwall, M. A. (2001) · Journal of Information Science · doi:10.1177/016555150102700503 · Cited by 202
Graph edit distance from spectral seriation
Robles-Kelly, A., & Hancock, E. R. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.56 · Cited by 200
Sales Territory Alignment: A Review and Model
Zoltners, A. A., & Sinha, P. (1983) · Management Science · doi:10.1287/mnsc.29.11.1237 · Cited by 181
Experiments in projection and clustering by simulated annealing
Klein, R. W., & Dubes, R. C. (1989) · Pattern Recognition · doi:10.1016/0031-3203(89)90067-8 · Cited by 176
On the Quality of Spectral Separators
Guattery, S., & Miller, G. L. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896312262 · Cited by 171
Exploring networks with traceroute-like probes: Theory and simulations
Dall’Asta, L., Alvarez-Hamelin, J. I., Barrat, A., Vázquez, A., & Vespignani, A. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.12.009 · Cited by 166
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Achlioptas, D., Clauset, A., Kempe, D., & Moore, C. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060693 · Cited by 163
Accuracy and Scaling Phenomena in Internet Mapping
Clauset, A., & Moore, C. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.018701 · Cited by 163
Spectral clustering and its use in bioinformatics
Higham, D. J., Kalna, G., & Kibble, M. (2007) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2006.04.026 · Cited by 161
Natural communities in large linked networks
Hopcroft, J. E., Khan, O., Kulis, B., & Selman, B. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956816 · Cited by 143
Mixing patterns and community structure in networksPreprint
Newman, M. E. J., & Girvan, M. (2013) · Cited by 130
Complexity of finding dense subgraphs
Asahiro, Y., Hassin, R., & Iwama, K. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00243-8 · Cited by 126
A unified framework for model-based clustering
ZhongShi, & GhoshJoydeep (2003) · Journal of Machine Learning Research · doi:10.5555/945365.964287 · Cited by 126
A decentralized algorithm for spectral analysis
Kempe, D., & McSherry, F. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007438 · Cited by 123
Conductance and congestion in power law graphs
Gkantsidis, C., Mihail, M., & Saberi, A. (2003) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/781027.781046 · Cited by 122
A web crawler design for data mining
Thelwall, M. A. (2001) · Journal of Information Science · doi:10.1177/0165551014233743 · Cited by 119
Classifying molecular sequences using a linkage graph with their pairwise similarities
Matsuda, H., Ishihara, T., & Hashimoto, A. (1999) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00091-7 · Cited by 116
Clustering Using Objective Functions and Stochastic Search
Booth, J. G., Casella, G., & Hobert, J. P. (2008) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.1467-9868.2007.00629.x · Cited by 110
On the NP-Completeness of Some Graph Cluster Measures
Šíma, J., & Schaeffer, S. E. (2006) · Lecture notes in computer science · doi:10.1007/11611257_51 · Cited by 106
Self-citationFast online graph clustering via Erdős–Rényi mixture
Zanghi, H., Ambroise, C., & Miele, V. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.06.019 · Cited by 103
Graph matching and clustering using spectral partitions
Qiu, H., & Hancock, E. R. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.06.014 · Cited by 100
Sparsest cuts and bottlenecks in graphs
Matula, D. W., & Shahrokhi, F. (1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90133-w · Cited by 97
Introduction to Markov Chains: With Special Emphasis on Rapid Mixing
Behrends, E. (1999) · Cited by 88
On Data Clustering Analysis: Scalability, Constraints, and Validation
Zai͏̈ane, O. R., Foss, A., Lee, C.-H., & Wang, W. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47887-6_4 · Cited by 87
Linearized cluster assignment via spectral ordering
Ding, C. H. Q., & He, X. (2004) · doi:10.1145/1015330.1015407 · Cited by 86
Mining scale-free networks using geodesic clustering
Wu, A. Y., Garland, M., & Han, J. (2004) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1014052.1014146 · Cited by 80
Algorithms for searching massive graphs
Agrawal, R., & Jagadish, H. V. (1994) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.277767 · Cited by 69
Boyer, F., Morgat, A., Labarre, L., Pothier, J. F., & Viari, A. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti711 · Cited by 65
O-Cluster: scalable clustering of large high dimensional data sets
Milenova, B. L., & Campos, M. M. (2003) · Proceedings · doi:10.1109/icdm.2002.1183915 · Cited by 63
A divide-and-merge methodology for clustering
Cheng, D., Vempala, S., Kannan, R., & Wang, G. J. (2005) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1065167.1065192 · Cited by 61
A hierarchical clustering algorithm based on fuzzy graph connectedness
Dong, Y., Zhuang, Y., Chen, K., & Tai, X. (2006) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2006.01.001 · Cited by 58
Problems in analysis : a symposium in honor of Salomon Bochner
Bochner, S., & Gunning, R. C. (1970) · Princeton University Press eBooks · Cited by 54
A measure of centrality based on the network efficiencyPreprint
Latora, V., & Massimo Marchiori, B. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0402050 · Cited by 54
Du, H., Feldman, M. W., Li, S., & Jin, X. (2007) · Complexity · doi:10.1002/cplx.20166 · Cited by 49
Cluster Graph Modification Problems
Ron Shamir, A., Sharan, R., & Tsur, D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36379-3_33 · Cited by 41
An information-theoretic measure of term specificity
Wong, S. K. M., & Yao, Y. Y. (1992) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199201)43:1<54::aid-asi5>3.0.co;2-a · Cited by 40
Kannan, N., Selvaraj, S., Gromiha, M. M., & Vishveshwara, S. (2001) · Proteins Structure Function and Bioinformatics · doi:10.1002/1097-0134(20010501)43:2<103::aid-prot1022>3.0.co;2-x · Cited by 32
A measure of betweenness centrality based on random walksPreprint
Newman, M. E. J. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0309045 · Cited by 32
Proceedings Eighth International Conference on Information Visualisation
(2004) · International Conference on Information Visualisation (IV) · doi:10.1109/iv.2004.1320108 · Cited by 27
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Orponen, P., & Schaeffer, S. E. (2005) · Lecture notes in computer science · doi:10.1007/11427186_45 · Cited by 18
Self-citationThe Complexity of Detecting Fixed-Density Clusters
Holzapfel, K., Kosub, S., Maaß, M. G., & Täubig, H. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44849-7_25 · Cited by 8
Tipping the balances of a small worldPreprint
Bettencourt, L. M. A. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0304321 · Cited by 4
(1997)
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“(Danon et al., 2007; Fortunato and Castellano, 2009; Newman, 2004a; Porter et al., 2009; Schaeffer, 2007)).”
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
Defining and evaluating network communities based on ground-truth
Yang, J., & Leskovec, J. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-013-0693-z · Cited by 1,411
Higher-order organization of complex networks
Benson, A. R., Gleich, D. F., & Leskovec, J. (2016) · Science · doi:10.1126/science.aad9029 · Cited by 1,270
Digital pathology and artificial intelligence
Niazi, M. K. K., Parwani, A. V., & Gurcan, M. N. (2019) · The Lancet Oncology · doi:10.1016/s1470-2045(19)30154-8 · Cited by 1,232
“Superpixels are grouped into anatomical regions (specifically epithelium) based on graph clustering [39].”
Background
Metadata
- Authors
- Schaeffer, S. E.
- Venue
- Computer Science Review
- Publisher
- Elsevier BV
- Published
- 2007-08
- Volume
- 1
- Issue
- 1
- Pages
- 27-64
- ISSN
- 1574-0137 (ISSN-L)
- OpenAlex
- W143174683
- Cited by
- 1,639
- References
- 167
- FWCI
- 17.79
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.