BioinformaticsBioinformaticsPeer-reviewed journal article
The effect of statistical normalisation on network propagation scores
Sergio Picart‐ArmadaiD, Wesley Kurt ThompsoniD, Alfonso BuiliD, Alexandre Perera-LlunaiD
Abstract
MotivationNetwork diffusion and label propagation are fundamental tools in computational biology, with applications like gene-disease association, protein function prediction and module discovery. More recently, several publications have introduced a permutation analysis after the propagation process, due to concerns that network topology can bias diffusion scores. This opens the question of the statistical properties and the presence of bias of such diffusion processes in each of its applications. In this work, we characterised some common null models behind the permutation analysis and the statistical properties of the diffusion scores. We benchmarked seven diffusion scores on three case studies: synthetic signals on a yeast interactome, simulated differential gene expression on a protein-protein interaction network and prospective gene set prediction on another interaction network. For clarity, all the datasets were based on binary labels, but we also present theoretical results for quantitative labels. ResultsDiffusion scores starting from binary labels were affected by the label codification, and exhibited a problem-dependent topological bias that could be removed by the statistical normalisation. Parametric and non-parametric normalisation addressed both points by being codification-independent and by equalising the bias. We identified and quantified two sources of bias -mean value and variance- that yielded performance differences when normalising the scores. We provided closed formulae for both and showed how the null covariance is related to the spectral properties of the graph. Despite none of the proposed scores systematically outperformed the others, normalisation was preferred when the sought positive labels were not aligned with the bias. We conclude that the decision on bias removal should be problem and data-driven, i.e. based on a quantitative analysis of the bias and its relation to the positive entities. AvailabilityThe code is publicly available at https://github.com/b2slab/diffuBench Contactsergi.picart@upc.edu
- Citations
- 4
- FWCI
- 0.16
- Field percentile
- 41th percentile
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Spurious inference when comparing networks
D. Farine, L. M. Aplin·bioRxiv·May 2, 2019
- A positive statistical benchmark to assess network agreement
Bingjie Hao, István A. Kovács·Nature CommunicationsPeer-reviewed·May 24, 2023
- Extending Comparison Methods for Unsigned Networks to Signed Networks
William Krinsman·bioRxiv·Sep 23, 2022
- The probability of edge existence due to node degree: a baseline for network-based predictions
Michael Zietz, Daniel Himmelstein, … Casey S. Greene·GigaSciencePeer-reviewed·Jan 1, 2024
- NetMix2: Unifying network propagation andaltered subnetworks
Uthsav Chitra, Tae Yoon Park, Benjamin J. Raphael·Lecture notes in computer sciencePeer-reviewed·Jan 1, 2022
- Accurately modeling biased random walks on weighted networks using node2vec+
Renming Liu, Matthew Hirn, Arjun Krishnan·BioinformaticsPeer-reviewed·Jan 1, 2023