The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Generalized Louvain method for community detection in large networks
Open accessAbstract
In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the κ-paths. This technique allows to efficiently compute a edge ranking in large networks in near linear time. Once the centrality ranking is calculated, the algorithm computes the pairwise proximity between nodes of the network. Finally, it discovers the community structure adopting a strategy inspired by the well-known state-of-the-art Louvain method (henceforth, LM), efficiently maximizing the network modularity. The experiments we carried out show that our algorithm outperforms other techniques and slightly improves results of the original LM, providing reliable results. Another advantage is that its adoption is naturally extended even to unweighted networks, differently with respect to the LM.
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
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424
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 · cited 5×
“Our analysis puts into evidence the following observations: i) classic not optimized algorithms (for example Girvan-Newman [8]) are unfeasible for large network analysis; ii) results obtained by using LM are slightly higher than those obtained by using FKCD; on the other hand, LM adopts local information in order to o…”
BackgroundMethodInfluentialFinding 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
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 1×
“There exist numerous comprehensive surveys to this problem, such as [2], [3].”
BackgroundOn Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
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
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
Benchmark graphs for testing community detection algorithms
Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008) · Physical Review E · doi:10.1103/physreve.78.046110 · Cited by 3,051
Resolution limit in community detection
Fortunato, S., & Barthélemy, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605965104 · Cited by 3,024
Cited by
Shen, X., Chen, Z., Backes, M., Shen, Y., & Zhang, Y. (2023) · arXiv · doi:10.48550/arxiv.2308.03825 · Cited by 861
Shen, X., Chen, Z., Backes, M., Shen, Y., & Zhang, Y. (2024) · Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3658644.3670388 · Cited by 441
“5 and Louvain algorithm [47] as our community detection algorithm (see Section A.”
The Specious Art of Single-Cell Genomics
Chari, T., & Pachter, L. (2021) · doi:10.1101/2021.08.25.457696 · Cited by 379
Freed-Pastor, W. A., Lambert, L. J., Ely, Z. A., Pattada, N. B., Bhutkar, A., Eng, G., Mercer, K. L., Garcia, A. P., Lin, L., Rideout, W. M., et al. (2021) · Cancer Cell · doi:10.1016/j.ccell.2021.07.007 · Cited by 273
Schöbel, S., Schmitt, A., Benner, D., Saqr, M., Janson, A., & Leimeister, J. M. (2024) · Information Systems Frontiers · doi:10.1007/s10796-023-10375-9 · Cited by 127
Interian, R., G. Marzo, R., Mendoza, I., & Ribeiro, C. C. (2023) · International Transactions in Operational Research · doi:10.1111/itor.13224 · Cited by 67
Surveyor: A System for Generating Coherent Survey Articles for Scientific Topics
Jha, R., Coke, R., & Radev, D. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9495 · Cited by 19
Nicastro, G. G., Sibinelli-Sousa, S., Hespanhol, J. T., Santos, T. W. C., Munoz, J. P., Santos, R. S., Perez-Sepulveda, B. M., Miyamoto, S., Aravind, L., de Souza, R. F., et al. (2026) · PLOS Biology · doi:10.1371/journal.pbio.3003680 · Cited by 9
Metadata
- Authors
- De Meo, P., Ferrara, E., Fiumara, G., & Provetti, A.
- Venue
- 2011 11th International Conference on Intelligent Systems Design and Applications
- Publisher
- IEEE
- Published
- 2011-11
- Pages
- 88-93
- OpenAlex
- W1966119405
- Cited by
- 440
- References
- 20
- FWCI
- 8.03
- Type
- conference paper
- Language
- en
- Open access
- green
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.