SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-80758"
 

Search: onr:"swepub:oai:DiVA.org:kth-80758" > On Sparsity As a Cr...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

On Sparsity As a Criterion in Reconstructing Biochemical Networks

Nordling, Torbjörn E. M., 1979- (author)
KTH,Reglerteknik
Jacobsen, Elling W., 1963- (author)
KTH,Reglerteknik
 (creator_code:org_t)
2011
2011
English.
In: Proceedings of the 18th International Federation of Automatic Control (IFAC) World Congress, 2011. ; , s. 11672-11678
  • Conference paper (peer-reviewed)
Abstract Subject headings
Close  
  • A common problem in inference of gene regulatory networks from experimental response data is the relatively small number of samples available in relation to the number of nodes/states. In many cases the identification problem is underdetermined and prior knowledge is required for the network reconstruction. A specific prior that has gained widespread popularity is the assumption that the underlying network is sparsely connected. This has led to a flood of network reconstruction algorithms based on subset selection and regularization techniques, mainly adopted from the statistics and signal processing communities. In particular, methods based on \ell_1 and \ell_2-penalties on the interaction strengths, such as LASSO, have been widely proposed and applied. We briefly review some of these methods and discuss their suitability for inferring the structure of biochemical networks. A particular problem is the fact that these methods provide little or no information on the uncertainty of individual identified edges, combined with the fact that the identified networks usually have a large fraction of false positives as well as false negatives.To partly overcome these problems we consider conditions that can be used to classify edges into those that can be uniquely determined based on a given incomplete data set, those that cannot be uniquely determined due to collinearity in the data and those for which no information is available. Apart from providing a label of confidence for the individual edges in the identified network, the classification can be used to improve the reconstruction by employing standard unbiased identification methods to the identifiable edges while employing sparse approximation methods for the remaining network. The method is demonstrated through application to a synthetic network in yeast which has recently been proposed for in vivo assessment of network identification methods.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)
NATURVETENSKAP  -- Biologi -- Bioinformatik och systembiologi (hsv//swe)
NATURAL SCIENCES  -- Biological Sciences -- Bioinformatics and Systems Biology (hsv//eng)

Keyword

Gene regulatory networks
Modelling
Network inference
Regularization
Reverse engineering
Sparse networks
System identification

Publication and Content Type

ref (subject category)
kon (subject category)

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Nordling, Torbjö ...
Jacobsen, Elling ...
About the subject
ENGINEERING AND TECHNOLOGY
ENGINEERING AND ...
and Electrical Engin ...
and Control Engineer ...
NATURAL SCIENCES
NATURAL SCIENCES
and Biological Scien ...
and Bioinformatics a ...
Articles in the publication
By the university
Royal Institute of Technology

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view