The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Identifying significant edges in graphical models of molecular networks
Open accessAbstract
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 L1 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
R: A Language and Environment for Statistical Computing
R Core Team (2025) · doi:10.32614/r.manuals · Cited by 352,181
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
(1988) · Cited by 16,582
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
(2009) · Cited by 6,153
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1023/a:1022623210503 · Cited by 3,231
Learning Bayesian networks: The combination of knowledge and statistical data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1007/bf00994016 · Cited by 2,017
Graphical Models in Applied Multivariate Statistics
Goodall, C. R. (1991) · Technometrics · doi:10.1080/00401706.1991.10484880 · Cited by 1,849
The max-min hill-climbing Bayesian network structure learning algorithm
Tsamardinos, I., Brown, L. E., & Aliferis, C. F. (2006) · Machine Learning · doi:10.1007/s10994-006-6889-7 · Cited by 1,822
Learning Bayesian Networks with the bnlearnR Package
Scutari, M. (2010) · Journal of Statistical Software · doi:10.18637/jss.v035.i03 · Cited by 1,733
Self-citationCausal Protein-Signaling Networks Derived from Multiparameter Single-Cell Data
Sachs, K., Perez, O., Pe'er, D., Lauffenburger, D. A., & Nolan, G. P. (2005) · Science · doi:10.1126/science.1105809 · Cited by 1,708
(2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100245 · Cited by 1,424
An Introduction to the Bootstrap.
Kimber, A., Efron, B., & Tibshirani, R. J. (1994) · The Statistician · doi:10.2307/2348146 · Cited by 1,245
Bayesian Artificial Intelligence
Korb, K. B., & Nicholson, A. E. (2003) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203491294 · Cited by 1,014
Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010)
Adams, R. P., Dahl, G. E., & Murray, I. (2010) · Cited by 966
Model selection and model averaging
Claeskens, G., & Hjort, N. L. (2008) · Cited by 872
Introduction to Graphical Modelling
Edwards, D. (2000) · Springer Texts in Statistics · doi:10.1007/978-1-4612-0493-0 · Cited by 825
Bayesian Artificial Intelligence
Korb, K. B., & Nicholson, A. E. (2010) · CRC Press eBooks · doi:10.1201/b10391 · Cited by 783
Beinlich, I. A., Suermondt, H. J., Chavez, R. M., & Cooper, G. F. (1989) · Lecture Notes in Medical Informatics · doi:10.1007/978-3-642-93437-7_28 · Cited by 724
Morgenthaler, O. (1930) · Bee World · doi:10.1080/0005772x.1930.11092929 · Cited by 700
Information Theory and Statistics: A Tutorial
Csiszár, I., & Shields, P. C. (2004) · now publishers, Inc. eBooks · doi:10.1561/9781933019543 · Cited by 589
Model Selection and Model Averaging
Ginestet, C. E. (2009) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2009.00614_5.x · Cited by 553
Husmeier, D. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg313 · Cited by 530
Learning Bayesian Network Structure from Massive Datasets: The "Sparse Candidate" Algorithm
Friedman, N., Nachman, I., & Pe’er, D. (1999) · arXiv (Cornell University) · doi:10.13140/2.1.1125.2169 · Cited by 501
Algorithms for Large Scale Markov Blanket Discovery
Tsamardinos, I., Aliferis, C., & Statnikov, A. (2003) · Cited by 438
Learning Bayesian Network Model Structure from Data
Margaritis, D. (2003) · Cited by 433
Geiger, D., & Heckerman, D. (1994) · Uncertainty Proceedings 1994 · doi:10.1016/b978-1-55860-332-5.50035-3 · Cited by 426
Vagis, A. A. (2002) · Journal of Automation and Information Sciences · doi:10.1615/jautomatinfscien.v34.i6.40 · Cited by 404
Adaptive Probabilistic Networks with Hidden Variables
Binder, J., Koller, D., Russell, S., & Kanazawa, K. (1997) · Machine Learning · doi:10.1023/a:1007421730016 · Cited by 377
Hausser, J., & Strimmer, K. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0811.3579 · Cited by 356
Aaoc, C. (2013) · Cited by 343
A Transformational Characterization of Equivalent Bayesian Network Structures
Chickering, D. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4938 · Cited by 296
Data Analysis with Bayesian Networks: A Bootstrap Approach
Friedman, N., Goldszmidt, M., & Wyner, A. J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6695 · Cited by 255
The wisdom of the body; a contemporary view
West, B. J. (2010) · Frontiers in Physiology · doi:10.3389/fphys.2010.00001 · Cited by 166
Causal Discovery from a Mixture of Experimental and Observational Data
Cooper, G. F., & Yoo, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6686 · Cited by 162
A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n
Castelo, R., & Roverato, A. (2006) · doi:10.5555/1248547.1248641 · Cited by 83
Efficient Markov Network Structure Discovery Using Independence Tests
Bromberg, F., Margaritis, D., & Honavar, V. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2773 · Cited by 64
Larrañaga, P., Sierra, B., Gallego, M. J., Michelena, M. J., & Picaza, J. M. (1997) · Lecture notes in computer science · doi:10.1007/bfb0029459 · Cited by 40
Bootstrap Analysis of Gene Networks Based on Bayesian Networks and Nonparametric Regression
Imoto, S., Kim, S. Y., Shimodaira, H., et al. (2002) · Proceedings Genome Informatics Workshop/Genome informatics · doi:10.11234/gi1990.13.369 · Cited by 31
Nagarajan (2010) · Frontiers in Psychiatry · doi:10.3389/fphys.2010.00021 · Cited by 20
Bayesian Network Structure Learning with Permutation Tests
Scutari, M., & Brogini, A. (2012) · Communication in Statistics- Theory and Methods · doi:10.1080/03610926.2011.593284 · Cited by 18
Self-citation
Cited by
Co-morbid obsessive–compulsive disorder and depression: A bayesian network approach
McNally, R. J., Mair, P., Mugno, B. L., & Riemann, B. C. (2017) · Psychological Medicine · doi:10.1017/s0033291716003287 · Cited by 308
“Finally, online Supplementary Figs S3 and S4 depict the identical DAGs computed via the Sachs et al. (2005) 85% criterion for edge retention and the Scutari & Nagarajan (2013) method, but with one difference.”
MethodMcNally, R. J., Heeren, A., & Robinaugh, D. J. (2017) · European Journal of Psychotraumatology · doi:10.1080/20008198.2017.1341276 · Cited by 272
Malgaroli, M., Maccallum, F., & Bonanno, G. A. (2018) · Psychological Medicine · doi:10.1017/s0033291718001769 · Cited by 116
A network approach to climate change anxiety and its key related features
Heeren, A., Mouguiama-Daouda, C., & McNally, R. J. (2023) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2022.102625 · Cited by 88
A network approach to the five-facet model of mindfulness
Heeren, A., Lannoy, S., Coussement, C., Hoebeke, Y., Verschuren, A., Blanchard, M. A., Chakroun-Baggioni, N., Philippot, P., & Gierski, F. (2021) · Scientific Reports · doi:10.1038/s41598-021-94151-2 · Cited by 39
Metadata
- Authors
- Scutari, M., & Nagarajan, R.
- Venue
- Artificial Intelligence in Medicine
- Publisher
- Elsevier BV
- Published
- 2013-03
- Volume
- 57
- Issue
- 3
- Pages
- 207-217
- ISSN
- 0933-3657 (ISSN-L)
- OpenAlex
- W2168192898
- Cited by
- 271
- References
- 43
- FWCI
- 4.42
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.