Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Block Diagram Reduction

Block Diagram Reduction

The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...

Graphs of Two-Variable Functions

Graphs of Two-Variable Functions

A weather map provides a practical example of a function of two variables. Across a wide region such as the United States, temperatures vary from one location to another. Each location can be identified by two geographic coordinates: longitude and latitude. Since a single temperature value is assigned to each coordinate pair, the situation can be represented mathematically as a function with two inputs and one output.In mathematical notation, longitude and latitude can be labeled as x and y,...

Graphs of Equations in Two Variables

Graphs of Equations in Two Variables

An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...

Deactivation Processes: Jablonski Diagram

Deactivation Processes: Jablonski Diagram

Luminescence, the emission of light by a substance that has absorbed energy, is a process that involves the interaction of molecules with light. The energy-level diagram, or Jablonski diagram, is a graphical representation of these interactions, illustrating the various states and transitions a molecule can undergo. In a typical Jablonski diagram, the lowest horizontal line represents the ground-state energy of the molecule, which is usually a singlet state. This state represents the energies...

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for k_a Estimation

This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...

Graphs of Functions

Graphs of Functions

Graphs of functions provide a visual representation of how output values change in response to varying inputs. Each point on the graph corresponds to an ordered pair, where the x-coordinate (independent variable) determines the horizontal position and the y-coordinate (dependent variable) determines the vertical position. Linear functions like y = x give a straight line, indicating a constant rate of change.Nonlinear functions display more complex behaviors. Even power functions generate...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Genetic architecture of oral glucose-stimulated insulin release provides biological insights into type 2 diabetes aetiology.

Nature metabolism·2024

Same author

Associations between vitamin D status in infants and blood lipids, body mass index and waist circumference.

Acta paediatrica (Oslo, Norway : 1992)·2011

Same author

Vitamin D status in infants: relation to nutrition and season.

European journal of clinical nutrition·2011

Same author

Determinants of blood glucose and insulin in healthy 9-month-old term Danish infants; the SKOT cohort.

Diabetic medicine : a journal of the British Diabetic Association·2010

Same author

Practical modeling of Bayesian decision problems - exploiting deterministic relations.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2008

Same author

[Serious criminality among adolescents. I. Twenty years of mental observations of 15-17 years old delinquents in greater Copenhagen].

Ugeskrift for laeger·2001

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

Maximal prime subgraph decomposition of Bayesian networks.

K G Olesen¹, A L Madsen

¹Dept. of Comput. Sci., Aalborg Univ.

IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society

|February 2, 2008

Summary

This study introduces a new method for decomposing Bayesian networks into maximal prime subgraphs (MPD). This MPD approach simplifies computations and enhances various Bayesian network tasks.

Related Experiment Videos

Last Updated: Jul 7, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

Area of Science:

Artificial Intelligence
Computer Science
Probability Theory

Background:

Bayesian networks are graphical models representing probabilistic relationships.
Efficient algorithms are crucial for inference and manipulation of Bayesian networks.
Decomposition into subgraphs can simplify complex network structures.

Purpose of the Study:

To present a novel method for decomposing Bayesian networks into their maximal prime subgraphs.
To prove the correctness of the proposed decomposition method.
To explore the applications of this decomposition in various Bayesian network tasks.

Main Methods:

The study proposes a new algorithm for the decomposition of Bayesian networks.
The correctness of the algorithm is mathematically proven.
The relationship between maximal prime subgraph decomposition (MPD) and maximal complete subgraphs of the moral graph is established.

Main Results:

The maximal prime subgraphs can be organized into a tree structure.
This tree structure serves as an efficient computational framework for LAZY propagation.
The MPD method offers benefits for divide and conquer triangulation, hybrid inference algorithms, and incremental junction tree construction.

Conclusions:

The proposed algorithm for MPD is simpler and more intuitive than existing methods.
It achieves the same computational complexity as standard algorithms for graph decomposition.
MPD provides a valuable computational structure for enhancing Bayesian network analysis and inference.