Evidence map›Paper›PMID 29046743›Full record

ArticleAlgorithms2017

Post-Processing Partitions to Identify Domains of Modularity Optimization.

William H Weir, Scott Emmons, Ryan Gibson, Dane Taylor, Peter J Mucha

Abstract read
In one paragraph

Article in Algorithms, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 18 papers.

0numbers the graph read from it
0cells of the map it votes in
18citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

18 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Constant community identification in million-scale networks.Social network analysis and mining · 2022
    Article
  9. Article
  10. Article
  11. Classification of Long Noncoding RNAs by k-mer Content.Methods in molecular biology (Clifton, N.J.) · 2021
    Article
  12. Article
  13. Article
  14. Comparing Shared Patient Networks Across Payers.Journal of general internal medicine · 2019
    Article
  15. Article
  16. Article
  17. Article
  18. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

William H WeirCarolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, NC 27599, USA.
Scott EmmonsCarolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, NC 27599, USA.
Ryan GibsonCarolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, NC 27599, USA.
Dane TaylorCarolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, NC 27599, USA.
Peter J MuchaCarolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, NC 27599, USA.

Funding

UNC Predoc Training Progr in Bioinformatics/Comp BiologyT32GM067553 · NIGMS · UNIV OF NORTH CAROLINA CHAPEL HILL · PI ELSTON, TIMOTHY C · 2005 to 2019
$2.5M
Models and Tools for Dynamic Health-Relevant Diffusion over Complex NetworksR01HD075712 · NICHD · DUKE UNIVERSITY · PI MOODY, JAMES, MUCHA, PETER JOHN · 2013 to 2018
$1.8M
EXPRESSION AND IRON-INDEPENDENT FUNCTIONS OF SIDEROPHORES IN URINARY TRACT INFECTR01DK099534 · NIDDK · WASHINGTON UNIVERSITY · PI HENDERSON, JEFFREY P · 2014 to 2018
$1.8M
Metabolomic Mechanisms of Nutritional Immunity in the Urinary TractR01DK111930 · NIDDK · WASHINGTON UNIVERSITY · PI HENDERSON, JEFFREY P · 2018 to 2021
$1.4M
Metabolomic Mechanisms of Nutritional Immunity in the Urinary TractR56DK111930 · NIDDK · WASHINGTON UNIVERSITY · PI HENDERSON, JEFFREY P · 2016 to 2016
$125k
NICHD NIH HHS R01 HD075712NIDDK NIH HHS R01 DK099534NIDDK NIH HHS R01 DK111930NIDDK NIH HHS R56 DK111930NIGMS NIH HHS T32 GM067553
6 · The paper itself

Abstract

We introduce the Convex Hull of Admissible Modularity Partitions (CHAMP) algorithm to prune and prioritize different network community structures identified across multiple runs of possibly various computational heuristics. Given a set of partitions, CHAMP identifies the domain of modularity optimization for each partition-i.e., the parameter-space domain where it has the largest modularity relative to the input set-discarding partitions with empty domains to obtain the subset of partitions that are "admissible" candidate community structures that remain potentially optimal over indicated parameter domains. Importantly, CHAMP can be used for multi-dimensional parameter spaces, such as those for multilayer networks where one includes a resolution parameter and interlayer coupling. Using the results from CHAMP, a user can more appropriately select robust community structures by observing the sizes of domains of optimization and the pairwise comparisons between partitions in the admissible subset. We demonstrate the utility of CHAMP with several example networks. In these examples, CHAMP focuses attention onto pruned subsets of admissible partitions that are 20-to-1785 times smaller than the sets of unique partitions obtained by community detection heuristics that were input into CHAMP.

Indexed as

community detectionmodularitymultilayer networksnetworksresolution parameter

Identifiers

PMID29046743
PMCPMC5642987

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.