The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Improved community detection in weighted bipartite networks
Open accessAbstract
Real-world complex networks are composed of non-random quantitative interactions. Identifying communities of nodes that tend to interact more with each other than the network as a whole is a key research focus across multiple disciplines, yet many community detection algorithms only use information about the presence or absence of interactions between nodes. Weighted modularity is a potential method for evaluating the quality of community partitions in quantitative networks. In this framework, the optimal community partition of a network can be found by searching for the partition that maximizes modularity. Attempting to find the partition that maximizes modularity is a computationally hard problem requiring the use of algorithms. QuanBiMo is an algorithm that has been proposed to maximize weighted modularity in bipartite networks. This paper introduces two new algorithms, LPAwb+ and DIRTLPAwb+, for maximizing weighted modularity in bipartite networks. LPAwb+ and DIRTLPAwb+ robustly identify partitions with high modularity scores. DIRTLPAwb+ consistently matched or outperformed QuanBiMo, while the speed of LPAwb+ makes it an attractive choice for detecting the modularity of larger networks. Searching for modules using weighted data (rather than binary data) provides a different and potentially insightful method for evaluating network partitions.
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
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
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 4×
“Many approaches to modularity maximization have been developed for binary bipartite networks, which do not necessarily reach the same result [5,13,14].”
BackgroundMethodInfluentialNewman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
(2020) · Radical Treatment · doi:10.2307/j.ctvw1d7dg.9 · Cited by 3,373
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
The modularity of pollination networks
Olesen, J. M., Bascompte, J., Dupont, Y. L., & Jordano, P. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0706375104 · Cited by 2,639
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.056131 · Cited by 2,476
Hierarchical structure and the prediction of missing links in networks
Clauset, A., Moore, C., & Newman, M. E. J. (2008) · Nature · doi:10.1038/nature06830 · Cited by 2,171
Introducing the bipartite Package: Analysing Ecological Networks
Dormann, C. F., Gruber, B., & Fründ, J. (2008) · GoeScholar The Publication Server of the Georg-August-Universität Göttingen (Georg-August-Universität Göttingen) · Cited by 1,893
Random graph models of social networks
Newman, M. E. J., Watts, D. J., & Strogatz, S. H. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.012582999 · Cited by 1,326
Performance of modularity maximization in practical contexts
Good, B. H., de Montjoye, Y.-A., & Clauset, A. (2010) · Physical Review E · doi:10.1103/physreve.81.046106 · Cited by 937
Modularity and community detection in bipartite networks
Barber, M. J. (2007) · Physical Review E · doi:10.1103/physreve.76.066102 · Cited by 771
A method for detecting modules in quantitative bipartite networks
Dormann, C. F., & Strauss, R. (2014) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.12139 · Cited by 533
Flowering Ecology of Some Spring Woodland Herbs
Schemske, D. W., Willson, M. F., Melampy, M. N., Miller, L. J., Verner, L., Schemske, K. M., & Best, L. B. (1978) · Ecology · doi:10.2307/1936379 · Cited by 466
The structure of a plant‐pollinator food web
Memmott, J. (1999) · Ecology Letters · doi:10.1046/j.1461-0248.1999.00087.x · Cited by 463
Module identification in bipartite and directed networks
Guimerà, R., Sales-Pardo, M., & Amaral, L. A. N. (2007) · Physical Review E · doi:10.1103/physreve.76.036102 · Cited by 406
Olesen, J. M., Eskildsen, L. I., & Venkatasamy, S. (2002) · Diversity and Distributions · doi:10.1046/j.1472-4642.2002.00148.x · Cited by 366
Strong contributors to network persistence are the most vulnerable to extinction
Saavedra, S., Stouffer, D. B., Uzzi, B., & Bascompte, J. (2011) · Nature · doi:10.1038/nature10433 · Cited by 341
Ecological Specialization and Susceptibility to Disturbance: Conjectures and Refutations
Vázquez, D. P., & Simberloff, D. (2002) · The American Naturalist · doi:10.1086/339991 · Cited by 301
Pollination Ecology of the Spring Wildflower Community of a Temperate Deciduous Forest
Motten, A. F. (1986) · Ecological Monographs · doi:10.2307/2937269 · Cited by 290
Junker, R. R., Blüthgen, N., Brehm, T., Binkenstein, J., Paulus, J., Martin Schaefer, H., & Stang, M. (2013) · Functional Ecology · doi:10.1111/1365-2435.12005 · Cited by 286
Analysis of community structure in networks of correlated data
Gómez, S., Jensen, P., & Arenas, A. (2009) · Physical Review E · doi:10.1103/physreve.80.016114 · Cited by 260
The Pollination Ecology of an Assemblage of Grassland Asclepiads in South Africa
OLLERTON, J. (2003) · Annals of Botany · doi:10.1093/aob/mcg206 · Cited by 226
The structure of a high latitude plant‐flower visitor system: the dominance of flies
Elberling, H., & Olesen, J. M. (1999) · Ecography · doi:10.1111/j.1600-0587.1999.tb00507.x · Cited by 220
Multi-scale structure and geographic drivers of cross-infection within marine bacteria and phages
Flores, C. O., Valverde, S., & Weitz, J. S. (2013) · The ISME Journal · doi:10.1038/ismej.2012.135 · Cited by 186
Pollination biology in the Snowy Mountains of Australia: Comparisons with montane Colorado, USA
INOUYE, D. W., & PYKE, G. H. (1988) · Australian Journal of Ecology · doi:10.1111/j.1442-9993.1988.tb00968.x · Cited by 177
Changes in interaction biodiversity induced by an introduced ungulate
Vázquez, D. P., & Simberloff, D. (2003) · Ecology Letters · doi:10.1046/j.1461-0248.2003.00534.x · Cited by 141
Pollination networks of oil‐flowers: a tiny world within the smallest of all worlds
Bezerra, E. L. S., Machado, I. C., & Mello, M. A. R. (2009) · Journal of Animal Ecology · doi:10.1111/j.1365-2656.2009.01567.x · Cited by 127
Thébault, É. (2012) · Journal of Biogeography · doi:10.1111/jbi.12015 · Cited by 107
BiMat: a MATLAB package to facilitate the analysis of bipartite networks
Flores, C. O., Poisot, T., Valverde, S., & Weitz, J. S. (2015) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.12458 · Cited by 78
Observations on the Pollination Biology of Plants on Melville Island, N.W.T., Canada
Mosquin, T., & Martin, J. E. H. (1967) · The Canadian Field-Naturalist · doi:10.5962/p.342770 · Cited by 70
An Efficient Algorithm for Optimizing Bipartite Modularity in Bipartite Networks
Liu, X., & Murata, T. (2010) · Journal of Advanced Computational Intelligence and Intelligent Informatics · doi:10.20965/jaciii.2010.p0408 · Cited by 48
Vázquez, D. P. (2002) · Cited by 22
Maximizing Barber’s bipartite modularity is also hard
Miyauchi, A., & Sukegawa, N. (2014) · Optimization Letters · doi:10.1007/s11590-014-0818-7 · Cited by 20
A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
Costa, A., & Hansen, P. (2013) · Optimization Letters · doi:10.1007/s11590-013-0621-x · Cited by 20
An a posteriori measure of network modularity
Poisot, T. (2013) · F1000Research · doi:10.12688/f1000research.2-130.v2 · Cited by 12
An a posteriori measure of network modularity
Poisot, T. (2013) · F1000Research · doi:10.12688/f1000research.2-130.v3 · Cited by 11
An a posteriori measure of network modularity
Poisot, T. (2013) · F1000Research · doi:10.12688/f1000research.2-130.v1 · Cited by 7
Cited by
BioTIME: A database of biodiversity time series for the Anthropocene
Dornelas, M., Antão, L. H., Moyes, F., Bates, A. E., Magurran, A. E., Adam, D., Akhmetzhanova, A. A., Appeltans, W., Arcos, J. M., Arnold, H., et al. (2018) · Global Ecology and Biogeography · doi:10.1111/geb.12729 · Cited by 431
Metadata
- Authors
- Beckett, S. J.
- Venue
- Royal Society Open Science
- Publisher
- The Royal Society
- Published
- 2016-01
- Volume
- 3
- Issue
- 1
- Pages
- 140536
- ISSN
- 2054-5703 (ISSN-L)
- OpenAlex
- W2270746387
- Cited by
- 530
- References
- 38
- FWCI
- 15.75
- Type
- journal article
- Language
- en
- Open access
- gold
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.