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

Gaussian Elimination: Problem Solving01:30

Gaussian Elimination: Problem Solving

Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

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.
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...
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

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, the...
Synthetic Disvision of Polynomials01:28

Synthetic Disvision of Polynomials

Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...

You might also read

Related Articles

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

Sort by
Same author

On the Limitations and Capabilities of Position Embeddings for Length Generalization.

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

Berberine Hydrochloride Enhances the Fluconazole Susceptibility of Candida albicans through Multiple Targets.

Current microbiology·2026
Same author

Roles of MADS-box transcription factors in plant responses to abiotic and biotic stresses.

Plant communications·2026
Same author

On the Adversarial Transferability of Generalized "Skip Connections".

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

Machine Vision-Enabled Octahedral Network Reconstruction and Structural Analysis of Perovskite Quantum Dots.

ACS nano·2026
Same author

The TaMADS2-TaTBL21 Module Enhances Wheat Resistance to Stripe Rust by Activating TaGKL-Mediated Immunity.

Plant biotechnology journal·2025
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

Related Experiment Videos

A rank-one update algorithm for fast solving kernel Foley-Sammon optimal discriminant vectors.

Wenming Zheng1, Zhouchen Lin, Xiaoou Tang

  • 1Key Laboratory of Child Development and Learning Science, Ministry of Education, Research Center for Learning Science, Southeast University, Nanjing, Jiangsu 210096, China. wenming_zheng@seu.edu.cn

IEEE Transactions on Neural Networks
|January 22, 2010
PubMed
Summary
This summary is machine-generated.

A new fast algorithm speeds up Kernel Foley-Sammon optimal discriminant vectors (KFSODVs) for pattern recognition. This method uses rank-one updates, significantly reducing computation time for complex datasets.

Related Experiment Videos

Area of Science:

  • Pattern Recognition
  • Statistical Learning Theory
  • Machine Learning

Background:

  • Foley-Sammon optimal discriminant vectors (FSODVs) enhance Fisher linear discriminant analysis (FLDA) by finding more discriminant vectors.
  • Kernel extensions (KFSODVs) enable nonlinear pattern recognition but face computational challenges.
  • Existing KFSODVs algorithms involve matrix inversions, leading to cubic complexity per discriminant vector.

Purpose of the Study:

  • To develop a computationally efficient algorithm for Kernel Foley-Sammon optimal discriminant vectors (KFSODVs).
  • To reduce the complexity of solving KFSODVs from cubic to quadratic per discriminant vector.
  • To generalize the proposed method for a broader class of dimensionality reduction techniques.

Main Methods:

  • Proposed a fast algorithm for KFSODVs based on rank-one update (ROU) of eigensystems.
  • The ROU approach avoids matrix inversions, reducing computational cost.
  • Generalized the method to efficiently solve optimally constrained generalized Rayleigh quotient (OCGRQ) problems.

Main Results:

  • The proposed algorithm achieves quadratic complexity for each discriminant vector, a significant improvement over cubic complexity.
  • Demonstrated effectiveness on multiple real-world datasets.
  • The generalized method efficiently handles various dimensionality reduction techniques.

Conclusions:

  • The novel rank-one update algorithm offers a substantial speedup for KFSODVs.
  • This advancement makes nonlinear discriminant analysis more practical for large-scale pattern recognition tasks.
  • The generalized approach provides an efficient framework for multiple dimensionality reduction methods.