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...
Cluster Sampling Method01:20

Cluster Sampling Method

Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
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...
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...
Propagation of Action Potentials01:23

Propagation of Action Potentials

The propagation of an action potential refers to the process by which a nerve impulse, or "action potential," travels along a neuron.
Neurons (nerve cells) have a resting membrane potential, with a slightly negative charge inside compared to outside. This is maintained by ion channels, such as sodium (Na+) and potassium (K+) channels, which control the flow of ions. When a stimulus, like a touch or a signal from another neuron, triggers the neuron, sodium channels open, allowing sodium ions to...

You might also read

Related Articles

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

Sort by
Same author

Foundation Model-Based Zero-Shot Tissue Segmentation of Pathological Images via the Mixture of Local-to-Global Experts.

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

EfficientCovNet: Modeling the Pairwise Voxel Dependency for Brain ROI Segmentation.

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

MoHD: Multi-mOdal survival prediction through Hierarchical Decoupling of whole-slide image pyramids and genomics.

Medical image analysis·2026
Same author

Functional system-specific brain aging across the Alzheimer's disease continuum.

Translational psychiatry·2026
Same author

Direct PET-to-CT Generation for Attenuation Correction: A Slice-to-Slice Continual Transformer Segmentation-Aware Network.

IEEE journal of biomedical and health informatics·2026
Same author

Shared genetic architecture between the topology of brain white matter structural connectome and fluid intelligence.

Communications biology·2026
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

Semisupervised kernel matrix learning by kernel propagation.

Enliang Hu1, Songcan Chen, Daoqiang Zhang

  • 1Department of Mathematics, Yunnan Normal University, Kunming, China. helnuaa@nuaa.edu.cn

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

Kernel Propagation (KP) enhances semisupervised kernel matrix learning (SS-KML) by efficiently learning a seed-kernel matrix and propagating it. This novel approach improves both effectiveness and efficiency in SS-KML tasks.

Related Experiment Videos

Area of Science:

  • Machine Learning
  • Data Science
  • Artificial Intelligence

Background:

  • Semisupervised kernel matrix learning (SS-KML) aims to construct kernel matrices with limited supervision.
  • Existing methods like pairwise constraints propagation (PCP) face scalability issues due to high computational costs.
  • There is a need for more effective and efficient SS-KML algorithms.

Purpose of the Study:

  • To introduce a novel algorithm, Kernel Propagation (KP), for improved SS-KML performance.
  • To address the limitations of existing SS-KML methods, particularly in terms of computational efficiency.
  • To develop practical out-of-sample extensions for KP.

Main Methods:

  • KP learns a small seed-kernel matrix from a supervised subset.
  • The seed-kernel matrix is then propagated to form a full-kernel matrix on the entire dataset.
  • The method involves solving a small-scale semidefinite programming (SDP) problem for the seed-kernel matrix.
  • Two out-of-sample extensions (batch and online) are developed based on the KP framework.

Main Results:

  • KP demonstrates significant improvements in both effectiveness and efficiency compared to state-of-the-art algorithms.
  • The proposed out-of-sample extensions are shown to be promising for kernel matrix learning.
  • KP offers a scalable solution to SS-KML problems.

Conclusions:

  • Kernel Propagation (KP) provides a superior approach to semisupervised kernel matrix learning.
  • The efficiency and effectiveness of KP make it a practical choice for large-scale applications.
  • The developed out-of-sample extensions enhance the utility of KP for dynamic and large datasets.