Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Gaussian Elimination: Problem Solving

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...

Mass Spectrometry: Complex Analysis

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 Estimation

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

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.

Linearization and Approximation

Linearization and Approximation

Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...

Extraction: Partition and Distribution Coefficients

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...

You might also read

Related Articles

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

Sort by

Same author

Inherited cancer predisposition sensitizes colonic mucosa to address Western diet effects and putative cancer-predisposing changes on mouse proteome.

The Journal of nutritional biochemistry·2014

Same author

Cancer-predicting gene expression changes in colonic mucosa of Western diet fed Mlh1+/- mice.

PloS one·2013

See all related articles

Search research articles

Related Experiment Video

Updated: May 12, 2026

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

Multiple spectral kernel learning and a gaussian complexity computation.

¹Aalto University, School of Science, Finland. nima.reyhani@aalto.fi

Neural Computation

|April 24, 2013

Summary

Multiple spectral kernel learning efficiently uses low-rank properties for large datasets. This novel approach improves computational efficiency in multiple kernel learning (MKL) by selecting optimal kernels.

Area of Science:

Machine Learning
Computational Statistics

Background:

Multiple Kernel Learning (MKL) addresses kernel selection in Support Vector Machines but faces numerical challenges with large datasets.
Existing MKL algorithms do not efficiently leverage the low-rank property of kernel matrices, leading to computational issues.

Purpose of the Study:

To propose a novel Multiple Spectral Kernel Learning (MSKL) method that efficiently utilizes the low-rank property of kernel matrices.
To develop a new theoretical bound for the Gaussian complexity of the proposed spectral kernel set.

Main Methods:

MSKL finds an optimal kernel matrix from a set of Gram matrices derived from eigenvectors of the original kernels.
The method constructs a spectral kernel set using a limited number of eigenvectors.
A new Gaussian complexity bound is derived for the MSKL kernel set.

Related Experiment Videos

Last Updated: May 12, 2026

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

Main Results:

The proposed MSKL method effectively utilizes the low-rank property for improved computational efficiency.
The new complexity bound depends on the kernel set's geometry and the number of Gram matrices.
The study demonstrates that adding kernels in MKL does not necessarily increase complexity, contrary to previous findings.

Conclusions:

MSKL offers a computationally efficient alternative for kernel selection in large-scale machine learning tasks.
The theoretical analysis provides new insights into the complexity of MKL, suggesting potential for more scalable algorithms.
This work advances MKL by integrating spectral methods to better handle large datasets and optimize kernel combinations.