17
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Identifying significant edges in graphical models of molecular networks

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          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.

          Related collections

          Most cited references25

          • Record: found
          • Abstract: found
          • Article: not found

          Causal protein-signaling networks derived from multiparameter single-cell data.

          Machine learning was applied for the automated derivation of causal influences in cellular signaling networks. This derivation relied on the simultaneous measurement of multiple phosphorylated protein and phospholipid components in thousands of individual primary human immune system cells. Perturbing these cells with molecular interventions drove the ordering of connections between pathway components, wherein Bayesian network computational methods automatically elucidated most of the traditionally reported signaling relationships and predicted novel interpathway network causalities, which we verified experimentally. Reconstruction of network models from physiologically relevant primary single cells might be applied to understanding native-state tissue signaling biology, complex drug actions, and dysfunctional signaling in diseased cells.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Learning Bayesian networks: The combination of knowledge and statistical data

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The max-min hill-climbing Bayesian network structure learning algorithm

                Bookmark

                Author and article information

                Contributors
                Journal
                Artif Intell Med
                Artif Intell Med
                Artificial Intelligence in Medicine
                Elsevier Science Publishing
                0933-3657
                1873-2860
                1 March 2013
                March 2013
                : 57
                : 3
                : 207-217
                Affiliations
                [a ]Genetics Institute, University College London, Darwin Building, Gower Street, WC1E 6BT London, United Kingdom
                [b ]Division of Biomedical Informatics, Department of Biostatistics, College of Public Health, University of Kentucky, 725 Rose Street, Multidisciplinary Science Bldg, 230F, Lexington, KY 40536-0082, USA
                Author notes
                [* ]Corresponding author. m.scutari@ 123456ucl.ac.uk
                Article
                S0933-3657(12)00154-6
                10.1016/j.artmed.2012.12.006
                4070079
                23395009
                06b8fbab-5166-48fe-ba4d-5df205f99651
                © 2012 Elsevier B.V.

                This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/3.0/).

                History
                : 6 December 2011
                : 14 December 2012
                : 16 December 2012
                Categories
                Article

                graphical models,bayesian networks,model averaging,l1 norm,molecular networks

                Comments

                Comment on this article