A smart local moving algorithm for large-scale modularity-based community detection
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The paper grouped cells into 565 subclusters using network-based clustering on biological independent component cell loadings.
“We then grouped cells based on combinations of “biological IC” cell loadings into 565 subclusters using network-based clustering”
From Molecular diversity and specializations among the cells of the adult mouse brain (2018) · cites this paper as Waltman and van Eck, 2013
The Conclusions (p. 19) say the source introduces an algorithm for modularity-based community detection in large networks, supporting its use as a network-clustering method. The source does not report grouping cells by biological IC loadings or obtaining 565 subclusters; in the citing sentence, “We” refers to the citing authors, not Waltman and van Eck. (LLM, conf=0.88)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
No citation lists for this paper
No citation lists for this paper yet — checked again daily.
References 34 · Cited by 1,088
Research works printed but not linked: 28
- Aloise, D., Cafieri, S., Caporossi, G., Hansen, P., Perron, S., & Liberti, L. (2010). Column generation algorithms for exact modularity maximization in networks. Physical Review E , 82 (4), 046112.
- Arenas, A., Duch, J., Fernández, A., & Gómez, S. (2007). Size reduction of complex networks preserving modularity. New Journal of Physics , 9 , 176.
- Barber, M.J., & Clark, J.W. (2009). Detecting network communities by propagating labels under constraints. Physical Review E , 80 (2), 026129.
- Blondel, V.D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment , 10 , P10008.
- Boldi, P., Codenotti, B., Santini, M., & Vigna, S. (2004). UbiCrawler: A scalable fully distributed Web crawler. Software: Practice and Experience , 34 (8), 711726.
- Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z., & Wagner, D. (2008). On modularity clustering. IEEE Transactions on Knowledge and Data Engineering , 20 (2), 172-188.
- Clauset, A., Newman, M.E.J., & Moore, C. (2004). Finding community structure in very large networks. Physical Review E , 70 (6), 066111.
- Duch, J. & Arenas, A. (2005). Community detection in complex networks using extremal optimization. Physical Review E , 72 (2), 027104.
- Fortunato, S. (2010). Community detection in graphs. Physics Reports , 486 (3-5), 75174.
- Guimerà, R., Sales-Pardo, M., & Amaral, L.A.N. (2004). Modularity from fluctuations in random graphs and complex networks. Physical Review E , 70 (2), 025101.
- Lee, J., Gross, S.P., & Lee, J. (2012). Modularity optimization by conformational space annealing. Physical Review E , 85 (5), 056702.
- Lehmann, S., & Hansen, L.K. (2007). Deterministic modularity optimization. European Physical Journal B , 60 (1), 83-88.
- Leicht, E.A., & Newman, M.E.J. (2008). Community structure in directed networks. Physical Review Letters , 100 (11), 118703.
- Liu, X., & Murata, T. (2010). Advanced modularity-specialized label propagation algorithm for detecting communities in networks. Physica A , 389 (7), 1493-1500.
- Mei, J., He, S., Shi, G., Wang, Z., & Li, W. (2009). Revealing network communities through modularity maximization by a contraction-dilation method. New Journal of Physics , 11 , 043025.
- Newman, M.E.J. (2004a). Fast algorithm for detecting community structure in networks. Physical Review E , 69 (6), 066133.
- Newman, M.E.J. (2004b). Analysis of weighted networks. Physical Review E , 70 (5), 056131.
- Newman, M.E.J. (2006a). Finding community structure in networks using the eigenvectors of matrices. Physical Review E , 74 (3), 036104.
- Reichardt, J., & Bornholdt, S. (2006). Statistical mechanics of community detection. Physical Review E , 74 (1), 016110.
- Rotta, R., & Noack, A. (2011). Multilevel local search algorithms for modularity clustering. Journal of Experimental Algorithmics , 16 (2), article 2.3.
- Schuetz, P., & Caflisch, A. (2008). Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Physical Review E , 77 (4), 046112.
- Traag, V.A., Van Dooren, P., & Nesterov, Y. (2011). Narrow scope for resolutionlimit-free community detection. Physical Review E , 84 (1), 016114.
- Waltman, L., & Van Eck, N.J. (2012). A new methodology for constructing a publication-level classification system of science. Journal of the American Society for Information Science and Technology , 63 (12), 2378-2392.
- Waltman, L., Van Eck, N.J., & Noyons, E.C.M. (2010). A unified approach to mapping and clustering of bibliometric networks. Journal of Informetrics , 4 (4), 629-635.
- Xu, G., Tsoka, S., & Papageorgiou, L.G. (2007). Finding community structures in complex networks using mixed integer optimisation. European Physical Journal B , 60 (2), 231-239.
- Yang, J., & Leskovec, J. (2012). Defining and evaluating network communities based on ground-truth. IEEE 12th International Conference on Data Mining (ICDM) , 745-754.
- Ye, Z., Hu, S., & Yu, J. (2008). Adaptive clustering algorithm for community detection in complex networks. Physical Review E , 78 (4), 046115.
- Zachary, W.W. (1977). An information flow model for conflict and fission in small groups. Journal of Anthropological Research , 33 (4), 452-473.
- Authors
- Waltman, L., & van Eck, N. J.
- Affiliations
- Leiden University (NL)
- Corresponding author
- Waltman, Ludo
- ORCID
- Waltman, Ludo
- Venue
- The European Physical Journal B
- Published
- 2013-11
- Volume
- 86
- Issue
- 11
- ISSN
- 1434-6028 (ISSN-L)
- 1434-6036
- OpenAlex
- W1984689597
- Cited by
- 1,088
- References
- 34
- Citations by year
- 2026: 68 · 2025: 118 · 2024: 183 · 2023: 135 · 2022: 134 · 2021: 131 · 2020: 99 · 2019: 84 · 2018: 45 · 2017: 37 · 2016: 33 · 2015: 12 · 2014: 9
- FWCI
- 12.81
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- The European Physical Journal B (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Leiden Repository (Leiden University) (submittedVersion)
- Springer Link (Chiba Institute of Technology) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Data Archiving and Networked Services (DANS) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
- Keywords
- community detection, modularity optimization, large-scale networks, Louvain algorithm, network clustering, computational efficiency
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
