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

81
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...
81
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

1.7K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
1.7K
Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

7.4K
The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
7.4K
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

114
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
114
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

106
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
106
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

299
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
299

You might also read

Related Articles

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

Sort by
Same author

Patient-reported outcomes as early indicators of recurrence, disease progression, and survival via machine learning in breast cancer.

NPJ breast cancer·2026
Same author

Pulse Self-Exam for Atrial Fibrillation Screening: A Randomized Controlled Trial.

JACC. Clinical electrophysiology·2026
Same author

Quantitative Lesion-Level Modeling Reveals Organ-Dependent Therapeutic Response.

Clinical pharmacology and therapeutics·2026
Same author

Single cell multiomic analysis of the impact of Delta-9-tetrahydrocannabinol on HIV infected CD4 T cells.

Journal of cannabis research·2026
Same author

Assessing Potential Benefit of Stroke Prophylaxis Therapy in Atrial Fibrillation and Atrial Flutter Using a Novel Competing Risk Scoring Tool.

Journal of the American Heart Association·2026
Same author

Checking the Cox Proportional Hazards Model with Interval-Censored Data.

Journal of the American Statistical Association·2025
Same journal

A SEQUENTIAL SIGNIFICANCE TEST FOR TREATMENT BY COVARIATE INTERACTIONS.

Statistica Sinica·2026
Same journal

DEFINING AND ESTIMATING PRINCIPAL STRATUM SPECIFIC NATURAL MEDIATION EFFECTS WITH SEMI-COMPETING RISKS DATA.

Statistica Sinica·2026
Same journal

Longitudinal Modeling of Rank-based Global Outcome.

Statistica Sinica·2026
Same journal

INTEGRATING INCOMPLETE DATA FOR MEDIATION ANALYSIS.

Statistica Sinica·2026
Same journal

COMMUNITY EXTRACTION OF NETWORK DATA UNDER STOCHASTIC BLOCK MODELS.

Statistica Sinica·2026
Same journal

STATISTICAL INFERENCE FOR MEAN FUNCTIONS OF COMPLEX 3D OBJECTS.

Statistica Sinica·2025
See all related articles

Related Experiment Video

Updated: Jul 23, 2025

Assisted Selection of Biomarkers by Linear Discriminant Analysis Effect Size LEfSe in Microbiome Data
04:57

Assisted Selection of Biomarkers by Linear Discriminant Analysis Effect Size LEfSe in Microbiome Data

Published on: May 16, 2022

16.0K

An Efficient Greedy Search Algorithm for High-dimensional Linear Discriminant Analysis.

Hannan Yang1, D Y Lin1, Quefeng Li1

  • 1Department of Biostatistics, University of North Carolina, Chapel Hill.

Statistica Sinica
|July 17, 2023
PubMed
Summary
This summary is machine-generated.

A new greedy search algorithm offers an efficient solution for high-dimensional classification using Linear Discriminant Analysis (LDA). This method significantly speeds up computation for big data problems while maintaining strong classification performance.

Keywords:
Mahalanobis distancegreedy searchhigh-dimensional classificationlinear discriminant analysisvariable selection

More Related Videos

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.6K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.6K

Related Experiment Videos

Last Updated: Jul 23, 2025

Assisted Selection of Biomarkers by Linear Discriminant Analysis Effect Size LEfSe in Microbiome Data
04:57

Assisted Selection of Biomarkers by Linear Discriminant Analysis Effect Size LEfSe in Microbiome Data

Published on: May 16, 2022

16.0K
Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.6K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.6K

Area of Science:

  • Statistics
  • Machine Learning
  • Data Science

Background:

  • High-dimensional classification is a critical statistical challenge with broad applications.
  • Linear Discriminant Analysis (LDA) is a common classification method.
  • Existing regularized LDA methods struggle with computational demands in ultra-high dimensions.

Purpose of the Study:

  • To develop a computationally efficient algorithm for high-dimensional LDA.
  • To address the limitations of existing methods in big data scenarios.
  • To provide a statistically guaranteed and interpretable LDA approach.

Main Methods:

  • Propose an efficient greedy search algorithm for high-dimensional LDA.
  • Utilize closed-form formulae for learning classification rules.
  • Establish theoretical guarantees for variable selection and error rate consistency.

Main Results:

  • The proposed algorithm drastically improves computational speed compared to existing high-dimensional LDA methods.
  • Maintains comparable or superior classification performance.
  • Provides an explicit interpretation of feature contributions in LDA.

Conclusions:

  • The greedy search algorithm offers a computationally feasible and effective solution for high-dimensional LDA.
  • This method is well-suited for big data applications requiring efficient classification.
  • The algorithm demonstrates strong theoretical properties and practical performance benefits.