Cargando…

Identifying significant edges in graphical models of molecular networks

OBJECTIVE: Modelling the associations from high-throughput experimental molecular data has provided unprecedented insights into biological pathways and signalling mechanisms. Graphical models and networks have especially proven to be useful abstractions in this regard. Ad hoc thresholds are often us...

Descripción completa

Detalles Bibliográficos
Autores principales: Scutari, Marco, Nagarajan, Radhakrishnan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier Science Publishing 2013
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4070079/
https://www.ncbi.nlm.nih.gov/pubmed/23395009
http://dx.doi.org/10.1016/j.artmed.2012.12.006
_version_ 1782322637315244032
author Scutari, Marco
Nagarajan, Radhakrishnan
author_facet Scutari, Marco
Nagarajan, Radhakrishnan
author_sort Scutari, Marco
collection PubMed
description OBJECTIVE: Modelling the associations from high-throughput experimental molecular data has provided unprecedented insights into biological pathways and signalling mechanisms. Graphical models and networks have especially proven to be useful abstractions in this regard. Ad hoc thresholds are often used in conjunction with structure learning algorithms to determine significant associations. The present study overcomes this limitation by proposing a statistically motivated approach for identifying significant associations in a network. METHODS AND MATERIALS: A new method that identifies significant associations in graphical models by estimating the threshold minimising the L(1) norm between the cumulative distribution function (CDF) of the observed edge confidences and those of its asymptotic counterpart is proposed. The effectiveness of the proposed method is demonstrated on popular synthetic data sets as well as publicly available experimental molecular data corresponding to gene and protein expression profiles. RESULTS: The improved performance of the proposed approach is demonstrated across the synthetic data sets using sensitivity, specificity and accuracy as performance metrics. The results are also demonstrated across varying sample sizes and three different structure learning algorithms with widely varying assumptions. In all cases, the proposed approach has specificity and accuracy close to 1, while sensitivity increases linearly in the logarithm of the sample size. The estimated threshold systematically outperforms common ad hoc ones in terms of sensitivity while maintaining comparable levels of specificity and accuracy. Networks from experimental data sets are reconstructed accurately with respect to the results from the original papers. CONCLUSION: Current studies use structure learning algorithms in conjunction with ad hoc thresholds for identifying significant associations in graphical abstractions of biological pathways and signalling mechanisms. Such an ad hoc choice can have pronounced effect on attributing biological significance to the associations in the resulting network and possible downstream analysis. The statistically motivated approach presented in this study has been shown to outperform ad hoc thresholds and is expected to alleviate spurious conclusions of significant associations in such graphical abstractions.
format Online
Article
Text
id pubmed-4070079
institution National Center for Biotechnology Information
language English
publishDate 2013
publisher Elsevier Science Publishing
record_format MEDLINE/PubMed
spelling pubmed-40700792014-06-26 Identifying significant edges in graphical models of molecular networks Scutari, Marco Nagarajan, Radhakrishnan Artif Intell Med Article OBJECTIVE: Modelling the associations from high-throughput experimental molecular data has provided unprecedented insights into biological pathways and signalling mechanisms. Graphical models and networks have especially proven to be useful abstractions in this regard. Ad hoc thresholds are often used in conjunction with structure learning algorithms to determine significant associations. The present study overcomes this limitation by proposing a statistically motivated approach for identifying significant associations in a network. METHODS AND MATERIALS: A new method that identifies significant associations in graphical models by estimating the threshold minimising the L(1) norm between the cumulative distribution function (CDF) of the observed edge confidences and those of its asymptotic counterpart is proposed. The effectiveness of the proposed method is demonstrated on popular synthetic data sets as well as publicly available experimental molecular data corresponding to gene and protein expression profiles. RESULTS: The improved performance of the proposed approach is demonstrated across the synthetic data sets using sensitivity, specificity and accuracy as performance metrics. The results are also demonstrated across varying sample sizes and three different structure learning algorithms with widely varying assumptions. In all cases, the proposed approach has specificity and accuracy close to 1, while sensitivity increases linearly in the logarithm of the sample size. The estimated threshold systematically outperforms common ad hoc ones in terms of sensitivity while maintaining comparable levels of specificity and accuracy. Networks from experimental data sets are reconstructed accurately with respect to the results from the original papers. CONCLUSION: Current studies use structure learning algorithms in conjunction with ad hoc thresholds for identifying significant associations in graphical abstractions of biological pathways and signalling mechanisms. Such an ad hoc choice can have pronounced effect on attributing biological significance to the associations in the resulting network and possible downstream analysis. The statistically motivated approach presented in this study has been shown to outperform ad hoc thresholds and is expected to alleviate spurious conclusions of significant associations in such graphical abstractions. Elsevier Science Publishing 2013-03 /pmc/articles/PMC4070079/ /pubmed/23395009 http://dx.doi.org/10.1016/j.artmed.2012.12.006 Text en © 2012 Elsevier B.V. http://creativecommons.org/licenses/by/3.0/ This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/3.0/).
spellingShingle Article
Scutari, Marco
Nagarajan, Radhakrishnan
Identifying significant edges in graphical models of molecular networks
title Identifying significant edges in graphical models of molecular networks
title_full Identifying significant edges in graphical models of molecular networks
title_fullStr Identifying significant edges in graphical models of molecular networks
title_full_unstemmed Identifying significant edges in graphical models of molecular networks
title_short Identifying significant edges in graphical models of molecular networks
title_sort identifying significant edges in graphical models of molecular networks
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4070079/
https://www.ncbi.nlm.nih.gov/pubmed/23395009
http://dx.doi.org/10.1016/j.artmed.2012.12.006
work_keys_str_mv AT scutarimarco identifyingsignificantedgesingraphicalmodelsofmolecularnetworks
AT nagarajanradhakrishnan identifyingsignificantedgesingraphicalmodelsofmolecularnetworks