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

Reducing Line Loss01:18

Reducing Line Loss

In a three-phase circuit, line loss is an indicator of energy dissipated as heat due to the resistance of transmission lines. To address this, incorporating transformers into the system—a step-up transformer at the source and a step-down transformer at the load—is a strategic solution. Two three-phase transformers are introduced to improve this.
With a step-up transformer at the source, the voltage is increased, thereby reducing the current in the transmission lines since power loss in...
Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

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...
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...
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...
Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
Detection of Gross Error: The Q Test01:00

Detection of Gross Error: The Q Test

When one or more data points appear far from the rest of the data, there is a need to determine whether they are outliers and whether they should be eliminated from the data set to ensure an accurate representation of the measured value. In many cases, outliers arise from gross errors (or human errors) and do not accurately reflect the underlying phenomenon. In some cases, however, these apparent outliers reflect true phenomenological differences. In these cases, we can use statistical methods...

You might also read

Related Articles

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

Sort by
Same author

Deep Kernel Principal Component Analysis for multi-level feature learning.

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

Learning With Asymmetric Kernels: Least Squares and Feature Interpretation.

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

Disentangled Representation Learning and Generation With Manifold Optimization.

Neural computation·2022
Same author

Compressing Features for Learning With Noisy Labels.

IEEE transactions on neural networks and learning systems·2022
Same author

Towards a Unified Quadrature Framework for Large-Scale Kernel Machines.

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

Unsupervised learning of disentangled representations in deep restricted kernel machines with orthogonality constraints.

Neural networks : the official journal of the International Neural Network Society·2021
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 Video

Updated: Jul 1, 2026

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation
13:04

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation

Published on: January 18, 2022

Kernel component analysis using an epsilon-insensitive robust loss function.

Carlos Alzate1, Johan A K Suykens

  • 1Department of Electrical Engineering ESAT-SCDSISTA, Katholieke Universiteit Leuven, B-3001 Leuven, Belgium. carlos.alzate@esat.kuleuven.be

IEEE Transactions on Neural Networks
|September 10, 2008
PubMed
Summary
This summary is machine-generated.

This study introduces robust and sparse kernel component analysis (KCA) by incorporating an epsilon-insensitive loss function. This approach enhances feature extraction by mitigating outlier effects and producing more interpretable principal components.

Related Experiment Videos

Last Updated: Jul 1, 2026

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation
13:04

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation

Published on: January 18, 2022

Area of Science:

  • Machine Learning
  • Data Science
  • Statistical Analysis

Background:

  • Kernel Principal Component Analysis (KPCA) is a nonlinear feature extraction method operating in high-dimensional spaces.
  • Standard KPCA relies on L(2) loss, which is sensitive to outliers, and lacks sparse representations.
  • Existing methods struggle with robustness and interpretability due to dense principal component expansions.

Purpose of the Study:

  • To develop a generalized Kernel Component Analysis (KCA) framework incorporating robust statistics.
  • To introduce both robustness and sparseness into KCA using an epsilon-insensitive loss function.
  • To propose novel algorithms for achieving robust and sparse KCA.

Main Methods:

  • Extended KPCA to a generalized KCA (gKCA) framework with explicit, general loss functions.
  • Introduced an epsilon-insensitive robust loss function to address outlier sensitivity.
  • Developed two algorithms: one solving nonlinear equations and another using iterative weighting for eigenvalue problems.

Main Results:

  • Demonstrated improved robustness against outliers in simulations.
  • Achieved sparse representations of principal components.
  • Validated the proposed methods on both synthetic and real-world datasets.

Conclusions:

  • The proposed robust and sparse KCA effectively addresses limitations of traditional KPCA.
  • The epsilon-insensitive loss function enhances the stability and interpretability of feature extraction.
  • The developed algorithms provide practical solutions for robust and sparse nonlinear dimensionality reduction.