Comments (2)
Cheers @stefpeschel. That really helps me understand it a bit better. Thank you for your detailed answer and reference.
from netcomi.
I would highly recommend reading the corresponding manuscript , which describes the SPRING method, it's parameters, and also the influence of different choices for lambda on the outcome in great detail.
The StARS method is used to find the optimal tuning parameter lambda by subsampling from the original data, where rep.num
is the number of samples that are taken and nlambda
defines the size of the set of possible tuning parameters from which the optimal lambda is chosen. In application section of the manuscript, a number of 50 is used for both parameters.
Generally speaking, the larger the two values (especially rep.num), the better. However, there's a tradeoff between stability of the resulting network and execution time. I would recommend choosing the values as high as possible so that the runtime is still acceptable for your data, but at least nlambda = 50
and rep.num = 50
. Actually, the hubs in your network should stabilize when increasing the number of repetitions. For greater advice I would like to refer to the authors of SPRING.
Note that the parameter choice also depends on whether you want to perform permutation tests for network comparison, because the network is estimated for each single permutation so that a longer runtime of network construction does considerably increase the overall runtime of the network comparison.
Best,
Stefanie
from netcomi.
Related Issues (20)
- Plotting with different line style HOT 2
- Edges with correlation value == -1 are not displayed in signed mode HOT 4
- How to look at sub-clusters? HOT 1
- output format for Gephi visualization HOT 2
- Colored by phylum HOT 2
- stability values using spieceasi HOT 1
- Problems while installing the NetCoMi HOT 1
- How to find a "good" algorithm and parameter set HOT 1
- RNA-seq data(Plant) HOT 1
- Error in length of dimnames after permutation testing HOT 1
- Labelling only certain taxa of interest HOT 1
- Will this package works for all lineage levels?
- Cross domain interactions HOT 3
- calculate the betweenness centrality as hubs HOT 2
- Looking for guidance on MANs Inference with samples from different metagenomics/metatranscriptomics studies HOT 4
- Error in NetConstruct for network comparison : "subscript out of bounds" HOT 4
- edges dont color correctly with negative correlations HOT 2
- Could I manually modify the color of each node? HOT 2
- Problem with the targets IDs in export to gephi HOT 4
- including correlations with environmental or experimental variables? HOT 3
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from netcomi.