CoChat

The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.

A Primer on Learning in Bayesian Networks for Computational Biology

Open access

Abstract

DOAJ is a unique and extensive index of diverse open access journals from around the world, driven by a growing community, committed to ensuring quality content is freely available online for everyone.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1371/journal.pcbi.0030129

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 An Example: Gene Regulatory Networks Gene regulatory networks provide a natural example for BN application. Genes correspond to nodes in the network, and regulatory relationships between genes are shown by directed edges. In the simple example above, gene G1 regulates G2, G3, and G5, gene G2 regulates G4 and G5, and gene G3 regulates G5. The probability distribution for the expression levels of each gene is modelled by the BN parameters. Simplification results from the fact that the probability distribution for a gene depends only on its regulators (parents) in the network. For instance, the expression levels of G4 and G5 are related only because they share a common regulator G2. In mathematical terms, they are conditionally independent given G2. Such relationships lead to factorisation of the full JPD into component conditional distributions, where each variable depends only on its parents in the network. p(G1, G2, G3, G4, G5) = p(G1)p(G2|G1)p(G3|G1)p(G4|G2)p(G5|G1, G2, G3)
Figure 1 An Example: Gene Regulatory Networks Gene regulatory networks provide a natural example for BN application. Genes correspond to nodes in the network, and regulatory relationships between genes are shown by directed edges. In the simple example above, gene G1 regulates G2, G3, and G5, gene G2 regulates G4 and G5, and gene G3 regulates G5. The probability distribution for the expression levels of each gene is modelled by the BN parameters. Simplification results from the fact that the probability distribution for a gene depends only on its regulators (parents) in the network. For instance, the expression levels of G4 and G5 are related only because they share a common regulator G2. In mathematical terms, they are conditionally independent given G2. Such relationships lead to factorisation of the full JPD into component conditional distributions, where each variable depends only on its parents in the network. p(G1, G2, G3, G4, G5) = p(G1)p(G2|G1)p(G3|G1)p(G4|G2)p(G5|G1, G2, G3)CC BY · PubMed Central
Figure 2 Illustration of Model Parameters for Two-Node Bayesian Network
Figure 2 Illustration of Model Parameters for Two-Node Bayesian NetworkCC BY · PubMed Central
Figure 3 Serial Connection
Figure 3 Serial ConnectionCC BY · PubMed Central
Figure 4 Diverging Connection
Figure 4 Diverging ConnectionCC BY · PubMed Central
Figure 5 Converging Connection
Figure 5 Converging ConnectionCC BY · PubMed Central
Figure 6 Graphical Model Illustrating Bayesian Inference
Figure 6 Graphical Model Illustrating Bayesian InferenceCC BY · PubMed Central
Figure 7 Naïve Bayes Classifier with Model Parameters in the Form of CPTs
Figure 7 Naïve Bayes Classifier with Model Parameters in the Form of CPTsCC BY · PubMed Central
Figure 8 The Effects of Different Strength Priors and Training Set Sizes (A) In this case, the observed data is ten interaction sites, of which five have high conservation, five low. As expected, in this case the likelihood peaks at p 2 = 0.5. The prior is B(7,3), indicating prior knowledge that high conservation is found in interaction sites; it corresponds to adding seven pseudocounts to the C = high category, and three to C = low, and produces a prior peaked above p 2 = 0.5. The posterior is also shown, along with the MAP estimate of p 2. The influence of the prior information in this case where the observed counts are low is clear. (B) Learning from 100 training examples (75 high, 25 low). Here the weak B(7,3) prior has little influence over the posterior distribution, and with a large training set the ML and MAP estimates are similar (p 2 ∼ 0.75). The posterior distribution for p 2 is narrower—some of the uncertainty about its value has been removed given the evidence (training examples). (C) Using a stronger prior B(70,30) still indicates that the most likely value for p 2 is 0.7; however, note that the prior is narrower—a lot of evidence would be needed to be convinced that p 2 was less than 0.6, say. Small samples are more susceptible to noise than larger samples. For a training set with five high and five low conservation scores, the ML estimate (p 2 = 0.5) is quite different from the MAP estimate of about 0.7, which takes into account the prior. Hopefully, this illustrates why priors are useful, but also cautions against choosing the wrong prior (or too strong/weak a prior)! (D) This final example has a B(70,30) prior and shows ML and MAP estimates from training data with 75 high and 25 low conservation scores. This combination of a good prior and a larger training set is the example here with the least uncertainty about the value of p 2.
Figure 8 The Effects of Different Strength Priors and Training Set Sizes (A) In this case, the observed data is ten interaction sites, of which five have high conservation, five low. As expected, in this case the likelihood peaks at p 2 = 0.5. The prior is B(7,3), indicating prior knowledge that high conservation is found in interaction sites; it corresponds to adding seven pseudocounts to the C = high category, and three to C = low, and produces a prior peaked above p 2 = 0.5. The posterior is also shown, along with the MAP estimate of p 2. The influence of the prior information in this case where the observed counts are low is clear. (B) Learning from 100 training examples (75 high, 25 low). Here the weak B(7,3) prior has little influence over the posterior distribution, and with a large training set the ML and MAP estimates are similar (p 2 ∼ 0.75). The posterior distribution for p 2 is narrower—some of the uncertainty about its value has been removed given the evidence (training examples). (C) Using a stronger prior B(70,30) still indicates that the most likely value for p 2 is 0.7; however, note that the prior is narrower—a lot of evidence would be needed to be convinced that p 2 was less than 0.6, say. Small samples are more susceptible to noise than larger samples. For a training set with five high and five low conservation scores, the ML estimate (p 2 = 0.5) is quite different from the MAP estimate of about 0.7, which takes into account the prior. Hopefully, this illustrates why priors are useful, but also cautions against choosing the wrong prior (or too strong/weak a prior)! (D) This final example has a B(70,30) prior and shows ML and MAP estimates from training data with 75 high and 25 low conservation scores. This combination of a good prior and a larger training set is the example here with the least uncertainty about the value of p 2.CC BY · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 19 references

Research works printed but not linked: 1

  1. BishopCM 2006 Pattern recognition and machine learning New York Springer 738

Cited by

See all 312

Metadata

Authors
Needham, C. J., Bradford, J. R., Bulpitt, A. J., & Westhead, D. R.
Affiliations
  • University of Leeds (GB)
  • Whitehead Institute for Biomedical Research (US)
Corresponding author
Needham, Chris J
Venue
PLoS Computational Biology
Published
2007-08-31
Volume
3
Issue
8
Pages
e129
ISSN
  • 1553-734X (ISSN-L)
  • 1553-7358
OpenAlex
W2117625122
Cited by
311
References
19
Citations by year
2026: 11 · 2025: 16 · 2024: 14 · 2023: 4 · 2022: 10 · 2021: 13 · 2020: 11 · 2019: 22 · 2018: 21 · 2017: 19 · 2016: 19 · 2015: 22 · 2014: 19 · 2013: 21 · 2012: 17
FWCI
19.71
Type
journal article
Language
en
Open access
Locations
  • PLoS Computational Biology (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • White Rose Research Online (University of Leeds, The University of Sheffield, University of York) (acceptedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • Directorate for Biological Sciences
  • Biotechnology and Biological Sciences Research Council (BBS/B/16585)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene Regulatory Network Analysis
  • Physical Sciences › Computer Science › Artificial Intelligence › Gaussian Processes and Bayesian Inference
Keywords
Bayesian networks, structure learning, computational biology, probabilistic graphical models
MeSH terms
Algorithms, Artificial Intelligence, Bayes Theorem, Computer Simulation, Models, Biological, Pattern Recognition, Automated, Models, Statistical, Computational Biology

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Primer on Learning in Bayesian Networks for Computational Biology. https://app.cochat.ai/papers/10.1371/journal.pcbi.0030129
The paper
Needham, C. J., Bradford, J. R., Bulpitt, A. J., & Westhead, D. R. (2007). A Primer on Learning in Bayesian Networks for Computational Biology. PLoS Computational Biology. https://doi.org/10.1371/journal.pcbi.0030129

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.