Graph biased feature selection of genes is better than random for many genes
Crawford, J.; Greene, C. S.
Show abstract
Recent work suggests that gene expression dependencies can be predicted almost as well by using random networks as by using experimentally derived interaction networks. We hypothesize that this effect is highly variable across genes, as useful and robust experimental evidence exists for some genes but not others. To explore this variation, we take the k-core decomposition of the STRING network, and compare it to a degree-matched random model. We show that when low-degree nodes are removed, expression dependencies in the remaining genes can be predicted better by the resulting network than by the random model.
Matching journals
The top 6 journals account for 50% of the predicted probability mass.
Similar papers in this journal
- PAN: Personalized Annotation-based Networks for the Prediction of Breast Cancer Relapse 96%
- PALLAS: Penalized mAximum LikeLihood and pArticle Swarms for inference of gene regulatory networks from time series data 95%
- Rapid Reconstruction of Time-varying Gene Regulatory Networks with Limited Main Memory 94%
Similar papers in this journal
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.