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

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...
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...
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...
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Extraction: Partition and Distribution Coefficients01:14

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

You might also read

Related Articles

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

Sort by
Same author

Mixture of Cluster-Conditional LoRA Experts for Vision-Language Instruction Tuning.

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

Generalized Distribution Aggregation Protocol for Federated Statistical Heterogeneity.

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

CompleMatch: Boosting Time-Series Semi-Supervised Classification With Temporal-Frequency Complementarity.

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

Dual-balancing for multi-task learning.

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

Domain-guided conditional diffusion model for unsupervised domain adaptation.

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

Searching to Exploit Memorization Effect in Deep Learning With Noisy Labels.

IEEE transactions on pattern analysis and machine intelligence·2024
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

Related Experiment Videos

Density-weighted Nyström method for computing large kernel eigensystems.

Kai Zhang1, James T Kwok

  • 1Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong. twinsen@cse.ust.hk

Neural Computation
|May 12, 2009
PubMed
Summary
This summary is machine-generated.

The density-weighted Nyström method improves kernel matrix approximation by assigning importance to samples. This enhanced sampling technique offers better eigensystem approximation with efficient computation.

Related Experiment Videos

Area of Science:

  • Machine Learning
  • Numerical Analysis
  • Linear Algebra

Background:

  • The Nyström method approximates eigensystems of large kernel matrices using sampling.
  • Standard Nyström method assumes equal sample importance, which is suboptimal for kernel eigenfunctions.
  • This assumption deviates from the underlying integral equation defining kernel eigenfunctions.

Purpose of the Study:

  • To extend the Nyström method for improved eigensystem approximation.
  • To introduce a density-weighted approach to account for varying sample importance.
  • To develop an efficient algorithm for implementing the density-weighted Nyström method.

Main Methods:

  • Developed a density-weighted Nyström method incorporating probability density functions.
  • Proposed an efficient algorithm for practical implementation of the weighted method.
  • Evaluated the method on kernel principal component analysis, spectral clustering, and image segmentation.

Main Results:

  • The density-weighted Nyström method significantly improves eigensystem approximation accuracy.
  • The proposed algorithm achieves this improvement with computational complexity similar to the original Nyström method.
  • Experiments demonstrated encouraging performance across various applications.

Conclusions:

  • Density weighting is a natural and effective scheme for enhancing the Nyström method.
  • The developed algorithm provides a computationally efficient alternative to existing methods.
  • The density-weighted Nyström method shows broad applicability and promising results in machine learning tasks.