2016
DOI: 10.1371/journal.pone.0152536
|View full text |Cite
|
Sign up to set email alerts
|

Assessing Low-Intensity Relationships in Complex Networks

Abstract: Many large network data sets are noisy and contain links representing low-intensity relationships that are difficult to differentiate from random interactions. This is especially relevant for high-throughput data from systems biology, large-scale ecological data, but also for Web 2.0 data on human interactions. In these networks with missing and spurious links, it is possible to refine the data based on the principle of structural similarity, which assesses the shared neighborhood of two nodes. By using simila… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 48 publications
(58 reference statements)
0
6
0
Order By: Relevance
“…The large input of freshwater is accompanied by heavy loading of nutrients, causing eutrophication, which is a major concern as it leads to the formation of a hypoxic bottom layer (Rabalais et al., 2009). The SCSPR is therefore a model system for studying threatened coastal ecosystems (Fennel & Testa, 2019), where changes in bacterial communities may precede detrimental effects on macroorganisms (Spitz et al., 2016).…”
Section: Introductionmentioning
confidence: 99%
“…The large input of freshwater is accompanied by heavy loading of nutrients, causing eutrophication, which is a major concern as it leads to the formation of a hypoxic bottom layer (Rabalais et al., 2009). The SCSPR is therefore a model system for studying threatened coastal ecosystems (Fennel & Testa, 2019), where changes in bacterial communities may precede detrimental effects on macroorganisms (Spitz et al., 2016).…”
Section: Introductionmentioning
confidence: 99%
“…The network of co-expressed genes was built considering gene selected through the preprocessing procedure as nodes and analyzing their expressions for N = 31 subjects under investigation. In particular, given genes i and j , with expressions on the cohort { i a } a = 1,…, N and { j b } b = 1,…, N respectively, we computed the absolute value [24]: where r ij is the Pearson’s pairwise correlation: with and mean values of the two expression distributions. The result is adjacency matrix C , in which each elements c ij = f ( d ij ) is a function of the correlation between expressions of genes i and j and characterizes the strength of the corresponding link in the network.…”
Section: Methodsmentioning
confidence: 99%
“…Starting from the 85 gene expressions x i , i = 1, …, 85, and the 199 subjects selected, we measured the absolute value of Pearson’s pairwise correlations s ij to define the network of co-expressed genes [ 22 ]: We did not considered the sign of the correlation since we focused on the strength of the relationship between the pairs of genes, while we were not interested in the direction of such relationship [ 15 ]. Hence, we obtained ‘adjacency matrix A ’, where each elements a ij = f ( s ij ) is a function of the correlation measurements and measures the weight of the connection between two nodes of the network.…”
Section: Methodsmentioning
confidence: 99%