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

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

1.3K
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...
1.3K
Uniform Distribution01:19

Uniform Distribution

6.3K
The uniform distribution is a continuous probability distribution of events with an equal probability of occurrence. This distribution is rectangular.
Two essential properties of this distribution are
6.3K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

376
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...
376
Binomial Probability Distribution01:15

Binomial Probability Distribution

16.2K
A binomial distribution is a probability distribution for a procedure with a fixed number of trials, where each trial can have only two outcomes.
The outcomes of a binomial experiment fit a binomial probability distribution. A statistical experiment can be classified as a binomial experiment if the following conditions are met:
There are a fixed number of trials. Think of trials as repetitions of an experiment. The letter n denotes the number of trials.
There are only two possible outcomes,...
16.2K
Central Limit Theorem01:14

Central Limit Theorem

20.8K
The central limit theorem, abbreviated as clt, is one of the most powerful and useful ideas in all of statistics. The central limit theorem for sample means says that if you repeatedly draw samples of a given size and calculate their means, and create a histogram of those means, then the resulting histogram will tend to have an approximate normal bell shape. In other words, as sample sizes increase, the distribution of means follows the normal distribution more closely.
The sample size, n, that...
20.8K
Distributions to Estimate Population Parameter01:26

Distributions to Estimate Population Parameter

5.3K
The accurate values of population parameters such as population proportion, population mean, and population standard deviation (or variance) are usually unknown. These are fixed values that can only be estimated from the data collected from the samples. The estimates of each of these parameters are sample proportion, the sample mean, and sample standard deviation (or variance). To obtain the values of these sample statistics, data are required that have particular distribution and central...
5.3K

You might also read

Related Articles

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

Sort by
Same author

Unsupervised feature selection via row-sparse local preserving projection.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

A Unified Framework for Pseudo-Supervised Clustering via Weighted Sample Aggregation.

IEEE transactions on pattern analysis and machine intelligence·2026
Same author

Projection with mixed-size anchor graphs.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

Natural Products Beyond Inhibition: A Mechanistic Framework Spanning Pockets, Interfaces, and Kinetic Barriers.

Molecules (Basel, Switzerland)·2026
Same author

SimMTC: Simple Multi-View Tensor Clustering.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Unsupervised fine-tuning of vision-language models by fusing classifier tuning and visual prompt tuning.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

Mask-guided Asymmetric Contrastive and Semantic Alignment for Unsupervised Person Re-Identification.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Hyperbolic Cycle Alignment for Infrared-Visible Image Fusion.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Learning Gaze Synthesizer via 3D-eye Controlled Diffusion and Cross-domain Feature Alignment.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Underlying Semantic Diffusion for Effective and Efficient In-Context Learning.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

DiffRES: Unleashing Text-to-Image Diffusion Models for Generative Referring Expression Segmentation without Information Leakage.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Location Matters: Frequency-Spatial Dual Space Adaptation for Cross-Domain Few-Shot Segmentation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
See all related articles

Related Experiment Video

Updated: Mar 8, 2026

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

3.0K

A Non-Greedy Algorithm for L1-Norm LDA.

Yang Liu, Quanxue Gao, Shuo Miao

    IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
    |January 24, 2017
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a novel non-greedy iterative algorithm for L1-norm-based linear discriminant analysis, improving dimensionality reduction. The new method effectively optimizes the objective function, outperforming existing greedy approaches in experiments.

    Related Experiment Videos

    Last Updated: Mar 8, 2026

    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

    3.0K

    Area of Science:

    • Machine Learning
    • Computer Vision
    • Data Science

    Background:

    • L1-norm-based discriminant subspace learning is gaining traction for dimensionality reduction.
    • Existing methods often use greedy strategies, solving for projection matrix columns individually.
    • This can lead to suboptimal solutions that do not fully optimize the trace ratio objective function.

    Purpose of the Study:

    • To propose a non-greedy iterative algorithm for L1-norm-based linear discriminant analysis (L1-LDA).
    • To address the limitations of greedy approaches in optimizing the trace ratio objective function.
    • To enhance the effectiveness of supervised dimensionality reduction techniques.

    Main Methods:

    • Developed a novel non-greedy iterative algorithm to solve the trace ratio form of L1-LDA.
    • Analyzed the convergence properties of the proposed algorithm.
    • Conducted extensive experiments on five benchmark image databases.

    Main Results:

    • The proposed non-greedy algorithm effectively maximizes the objective function value.
    • Experimental results demonstrate superior performance compared to existing L1-LDA algorithms.
    • The algorithm shows significant improvements in dimensionality reduction tasks.

    Conclusions:

    • The non-greedy iterative approach offers a more effective way to solve L1-LDA.
    • This method provides better optimization of the trace ratio criterion for supervised dimensionality reduction.
    • The proposed algorithm represents an advancement in L1-norm-based subspace learning.