.png){kind=icon}
.png){kind=icon}
Return
Iterative procedure for network inference
.png){kind=icon}
OA
AI
DOI：10.1016/j.cnsns.2020.105286.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
When a network is reconstructed from data, two types of errors can occur: false positive and false negative errors about the presence or absence of links. In this paper, the vertex degree distribution of the true underlying network is analytically reconstructed using an iterative procedure. Such procedure is based on the inferred network and estimates for the probabilities alpha and beta of type I and type II errors, respectively. The iteration procedure consists of choosing various values for alpha to perform the iteration steps of the network reconstruction. For the first step, the standard value for alpha of 0.05 can be chosen as an example. The result of this first step gives a first estimate of the network topology of interest. For the second iteration step the value for alpha is adjusted according to the findings of the first step. This procedure is iterated, ultimately leading to a reconstruction of the vertex degree distribution tailored to its previously unknown network topology. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Network inference
Node degree distribution
False positive
false negative
Statistical inference
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
9.2K
Citations:
1.8W