Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal Sparsity Criteria for Network Inference
Stockholm University, Science for Life Laboratory.
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, Centres, Science for Life Laboratory, SciLifeLab.
KTH, Centres, Science for Life Laboratory, SciLifeLab.
Stockholm University, Science for Life Laboratory.
2013 (English)In: Journal of Computational Biology, ISSN 1066-5277, E-ISSN 1557-8666, Vol. 20, no 5, 398-408 p.Article in journal (Refereed) Published
Abstract [en]

Gene regulatory network inference (that is, determination of the regulatory interactions between a set of genes) provides mechanistic insights of central importance to research in systems biology. Most contemporary network inference methods rely on a sparsity/regularization coefficient, which we call zeta (zeta), to determine the degree of sparsity of the network estimates, that is, the total number of links between the nodes. However, they offer little or no advice on how to select this sparsity coefficient, in particular, for biological data with few samples. We show that an empty network is more accurate than estimates obtained for a poor choice of zeta. In order to avoid such poor choices, we propose a method for optimization of zeta, which maximizes the accuracy of the inferred network for any sparsity-dependent inference method and data set. Our procedure is based on leave-one-out cross-optimization and selection of the zeta value that minimizes the prediction error. We also illustrate the adverse effects of noise, few samples, and uninformative experiments on network inference as well as our method for optimization of zeta. We demonstrate that our zeta optimization method for two widely used inference algorithms-Glmnet and NIR-gives accurate and informative estimates of the network structure, given that the data is informative enough.

Place, publisher, year, edition, pages
2013. Vol. 20, no 5, 398-408 p.
Keyword [en]
algorithms, gene networks, linear algebra
National Category
Biochemistry and Molecular Biology
Identifiers
URN: urn:nbn:se:kth:diva-124050DOI: 10.1089/cmb.2012.0268ISI: 000318854500004Scopus ID: 2-s2.0-84881569817OAI: oai:DiVA.org:kth-124050DiVA: diva2:633465
Note

QC 20130627

Available from: 2013-06-27 Created: 2013-06-25 Last updated: 2017-12-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Nordling, Torbjorn E. M.Studham, MatthewSonnhammer, Erik L. L.
By organisation
Automatic ControlScience for Life Laboratory, SciLifeLab
In the same journal
Journal of Computational Biology
Biochemistry and Molecular Biology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 35 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf