Corpus ID: 237572045

Network Refinement: A unified framework for enhancing signal or removing noise of networks

  title={Network Refinement: A unified framework for enhancing signal or removing noise of networks},
  author={Jiating Yu and Jiacheng Leng and Ling-Yun Wu},
Networks are widely used in many fields for their powerful ability to provide vivid representations of relationships between variables. However, many of them may be corrupted by experimental noise or inappropriate network inference methods that inherently hamper the efficacy of network-based downstream analysis. Consequently, it’s necessary to develop systematic methods for denoising networks, namely, improve the Signal-to-Noise Ratio (SNR) of noisy networks. In this paper, we have explored the… Expand
1 Citations

Figures and Tables from this paper

Understanding the network formation pattern for better link prediction
  • Jiating Yu, Ling-Yun Wu
  • Computer Science, Physics
  • ArXiv
  • 2021
The link prediction problem refers to using the information of the observed network, like the properties of the nodes and edges, to predict the existence of edges between pairs of unconnected nodes, which is crucial for understanding the network formation mechanism. Expand


Network enhancement as a general method to denoise weighted biological networks
Experiments show that Network Enhancement (NE) improves gene–function prediction by denoising tissue-specific interaction networks, alleviates interpretation of noisy Hi-C contact maps from the human genome, and boosts fine-grained identification accuracy of species. Expand
Network deconvolution as a general method to distinguish direct dependencies in networks
This work presents a general method for inferring direct effects from an observed correlation matrix containing both direct and indirect effects, and introduces an algorithm that removes the combined effect of all indirect paths of arbitrary length in a closed-form solution by exploiting eigen-decomposition and infinite-series sums. Expand
ARACNE: An Algorithm for the Reconstruction of Gene Regulatory Networks in a Mammalian Cellular Context
This approach should enhance the ability to use microarray data to elucidate functional mechanisms that underlie cellular processes and to identify molecular targets of pharmacological compounds in mammalian cellular networks. Expand
Enhanced modularity-based community detection by random walk network preprocessing.
This paper proposes to use a strategy to preprocess networks before feeding them into modularity-based algorithms, based on the observation that dynamic processes triggered on vertices in the same community possess similar behavior patterns but dissimilar on Vertices in different communities. Expand
Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems. Expand
Network link prediction by global silencing of indirect correlations
The fundamental properties of dynamical correlations in networks are exploited to develop a method to silence indirect effects and help translate the abundant correlation data into valuable local information, with applications ranging from link prediction to inferring the dynamical mechanisms governing biological networks. Expand
Gene Regulatory Network Reconstruction Using Conditional Mutual Information
This work proposes a relevance network model for gene regulatory network inference which employs both mutual information and conditional mutual information to determine the interactions between genes and proposes a conditional mutual Information estimator based on adaptive partitioning which allows us to condition on both discrete and continuous random variables. Expand
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Physics, Computer Science
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability. Expand
Inferring gene regulatory networks by ANOVA
A new score for network inference, η(2), that is derived from an analysis of variance that has a number of interesting features that enable the efficient detection of gene regulatory interactions. Expand
Finding community structure in networks using the eigenvectors of matrices.
  • M. Newman
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
A modularity matrix plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations, and a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong are proposed. Expand