2019
DOI: 10.1101/807511
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

manta- a clustering algorithm for weighted ecological networks

Abstract: Microbial network inference and analysis has become a successful approach to generate biological hypotheses from microbial sequencing data.Network clustering is a crucial step in this analysis. Here, we present a novel heuristic flow-based network clustering algorithm, which equals or outperforms existing algorithms on noise-free synthetic data. manta comes with unique strengths such as the ability to identify nodes that represent an intermediate between clusters, to exploit negative edges and to assess the ro… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 33 publications
0
4
0
Order By: Relevance
“…For each research task, we applied multiple method combinations to the discovery data, involving normalization methods (clr [30], mclr [31], and VST [32]), association estimation (Pearson correlation, Spearman correlation, latentcor [33], SPRING [31], and proportionality [34]), sparsification ( t -test, threshold method, and neighborhood selection), and, for the first research task, clustering (hierarchical clustering, spectral clustering [35], fast greedy modularity optimization [36], Louvain method for community detection [37], and manta [38]). Detailed descriptions of the combinations are given in Section 4.3.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…For each research task, we applied multiple method combinations to the discovery data, involving normalization methods (clr [30], mclr [31], and VST [32]), association estimation (Pearson correlation, Spearman correlation, latentcor [33], SPRING [31], and proportionality [34]), sparsification ( t -test, threshold method, and neighborhood selection), and, for the first research task, clustering (hierarchical clustering, spectral clustering [35], fast greedy modularity optimization [36], Louvain method for community detection [37], and manta [38]). Detailed descriptions of the combinations are given in Section 4.3.…”
Section: Resultsmentioning
confidence: 99%
“…Algorithms from the first category are based on (dis)similarity matrices: hierarchical clustering and spectral clustering [35]. Algorithms from the second category are based on networks with weighted edges: fast greedy modularity optimization [36], the Louvain method for community detection [37], and the manta algorithm [38].…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, taxa in the CAN were compared to taxa reported as indicators of high microbial abundance or low microbial abundance (Moitinho-Silva, Steinert, et al, 2017). CAN network clusters were identified with manta (Röttjers & Faust, 2020b), as this algorithm has been designed to handle negative edges in the CAN. To run the clustering algorithm, default settings were used, except the number of iterations and permutations, which was set to 200.…”
Section: /25mentioning
confidence: 99%