Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Mass Spectrometry: Complex Analysis01:21

Mass Spectrometry: Complex Analysis

Mass spectrometry is an important technique for the identification of pure compounds. However, it has some limitations for the analysis of complex mixtures, often due to excessive fragmentation making the spectrum too complicated to decipher. Mass spectrometry can be combined with suitable separation methods in sequence, forming hyphenated methods, which are useful in the analysis of complex mixtures.
GC–MS is a powerful hyphenated method commonly used in forensics and environmental...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka 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...

You might also read

Related Articles

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

Sort by
Same author

[Spatial-temporal Evolution and Driving Force Analysis of FVC in the Arid Region of Northwest China].

Huan jing ke xue= Huanjing kexue·2025
Same author

Microbe-induced gene silencing of fungal gene confers efficient resistance against <i>Fusarium graminearum</i> in maize.

aBIOTECH·2025
Same author

Resinacein S, a novel triterpenoid from functional mushroom Ganoderma resinaceum, curbs obesity by regulating thermogenesis and energy metabolism.

Journal of food science·2025
Same author

Association Between Ankle-Brachial Index and Risk of Early Neurological Deterioration After Acute Isolated Pontine Infarction.

Brain and behavior·2025
Same author

Uncoupling protein 1 deficiency leads to transcriptomic differences in livers of pregnancy female mice and aggravates hepatic steatosis.

Archives of biochemistry and biophysics·2025
Same author

Exploring the challenges of RNAi-based strategies for crop protection.

Advanced biotechnology·2025

Related Experiment Video

Updated: Jun 28, 2026

Ultrafast Lignin Extraction from Unusual Mediterranean Lignocellulosic Residues
09:22

Ultrafast Lignin Extraction from Unusual Mediterranean Lignocellulosic Residues

Published on: March 9, 2021

Fast ML estimation for the mixture of factor analyzers via an ECM algorithm.

Jian-Hua Zhao1, Philip L H Yu

  • 1Department of Statistics and Actuarial Science, The University of HongKong, Shek Tong Tsui, Hong Kong. jhzhao.ynu@gmail.com

IEEE Transactions on Neural Networks
|November 13, 2008
PubMed
Summary

We introduce a fast Expectation Conditional Maximization (ECM) algorithm for Mixture of Factor Analyzers (MFA) estimation. This novel approach significantly accelerates convergence compared to existing Expectation-Maximization (EM) methods.

More Related Videos

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions
11:22

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions

Published on: January 30, 2018

Measurement of Coherence Decay in GaMnAs Using Femtosecond Four-wave Mixing
15:58

Measurement of Coherence Decay in GaMnAs Using Femtosecond Four-wave Mixing

Published on: December 3, 2013

Related Experiment Videos

Last Updated: Jun 28, 2026

Ultrafast Lignin Extraction from Unusual Mediterranean Lignocellulosic Residues
09:22

Ultrafast Lignin Extraction from Unusual Mediterranean Lignocellulosic Residues

Published on: March 9, 2021

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions
11:22

Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions

Published on: January 30, 2018

Measurement of Coherence Decay in GaMnAs Using Femtosecond Four-wave Mixing
15:58

Measurement of Coherence Decay in GaMnAs Using Femtosecond Four-wave Mixing

Published on: December 3, 2013

Area of Science:

  • Machine Learning
  • Statistical Modeling
  • Computational Statistics

Background:

  • Mixture of Factor Analyzers (MFA) models are widely used for dimensionality reduction and clustering.
  • Existing Expectation-Maximization (EM) algorithms for MFA estimation can be computationally intensive and slow to converge.
  • Previous methods often treat both component-indicator vectors and latent factors as missing data.

Purpose of the Study:

  • To propose a novel and computationally efficient algorithm for Maximum-Likelihood (ML) estimation in MFA models.
  • To develop an Expectation Conditional Maximization (ECM) algorithm that simplifies the missing data structure.
  • To demonstrate substantial improvements in convergence speed over existing EM-based algorithms.

Main Methods:

  • Developed a fast Expectation Conditional Maximization (ECM) algorithm specifically for MFA.
  • The proposed ECM algorithm treats only component-indicator vectors as missing data.
  • Derived explicit closed-form solutions for all Conditional Maximization (CM) steps, avoiding numerical optimization.

Main Results:

  • The proposed ECM algorithm demonstrated significantly faster convergence than standard EM and Alternating ECM (AECM) algorithms.
  • Convergence speed was improved in terms of both Central Processing Unit (CPU) time and the number of iterations required.
  • Experimental results validate the efficiency and effectiveness of the novel ECM approach.

Conclusions:

  • The fast ECM algorithm offers a more efficient alternative for ML estimation in MFA models.
  • Simplifying the missing data structure leads to significant computational advantages.
  • This work provides a valuable tool for researchers and practitioners working with MFA.