Evidence map›Paper›PMID 38323677›Full record

ArticleGigaScience2024

The probability of edge existence due to node degree: a baseline for network-based predictions.

Michael Zietz, Daniel S Himmelstein, Kyle Kloster, Christopher Williams, Michael W Nagle, Casey S Greene

Abstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
11citing 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

11 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Bias-aware training and evaluation of link prediction algorithms in network biology.Proceedings of the National Academy of Sciences of the United States of America · 2025
    Article
  5. Review
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Constructing knowledge graphs and their biomedical applications.Computational and structural biotechnology journal · 2020
    Review
4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

6 authors.

Michael ZietzDepartment of Systems Pharmacology and Translational Therapeutics, University of Pennsylvania, Philadelphia, PA 19104, USA.ORCID 0000-0003-0539-630X
Daniel S HimmelsteinDepartment of Systems Pharmacology and Translational Therapeutics, University of Pennsylvania, Philadelphia, PA 19104, USA.ORCID 0000-0002-3012-7446
Kyle KlosterCarbon, Inc., Redwood City, CA 94063, USA.ORCID 0000-0001-5678-7197
Christopher WilliamsDepartment of Systems Pharmacology and Translational Therapeutics, University of Pennsylvania, Philadelphia, PA 19104, USA.ORCID 0000-0002-5613-3051
Michael W NagleInternal Medicine Research Unit, Pfizer Worldwide Research, Development, and Medical, Cambridge, MA 02139, USA.ORCID 0000-0002-4677-7582
Casey S GreeneDepartment of Systems Pharmacology and Translational Therapeutics, University of Pennsylvania, Philadelphia, PA 19104, USA.ORCID 0000-0001-8713-9213

Funding

Network-based algorithms for target identification and drug repositioning from genetic associationsR01HG010067 · NHGRI · UNIVERSITY OF PENNSYLVANIA · PI GREENE, CASEY S · 2018 to 2022
$3.2M
NHGRI NIH HHS R01 HG010067NIH HHS R01 HG010067
6 · The paper itself

Abstract

Important tasks in biomedical discovery such as predicting gene functions, gene-disease associations, and drug repurposing opportunities are often framed as network edge prediction. The number of edges connecting to a node, termed degree, can vary greatly across nodes in real biomedical networks, and the distribution of degrees varies between networks. If degree strongly influences edge prediction, then imbalance or bias in the distribution of degrees could lead to nonspecific or misleading predictions. We introduce a network permutation framework to quantify the effects of node degree on edge prediction. Our framework decomposes performance into the proportions attributable to degree and the network's specific connections using network permutation to generate features that depend only on degree. We discover that performance attributable to factors other than degree is often only a small portion of overall performance. Researchers seeking to predict new or missing edges in biological networks should use our permutation approach to obtain a baseline for performance that may be nonspecific because of degree. We released our methods as an open-source Python package (https://github.com/hetio/xswap/).

Indexed as

AlgorithmsProbabilitybioinformaticsedge predictionedge priorheterogeneousknowledge graphsnetworksnode degreepermutationPythonXSwap

Identifiers

PMID38323677
PMCPMC10848215

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.