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

Cluster Sampling Method01:20

Cluster Sampling Method

13.8K
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...
13.8K
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

16.5K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
16.5K
Graphs of Equations in Two Variables01:30

Graphs of Equations in Two Variables

112
An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...
112
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

1.0K
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...
1.0K
Structural Classification of Joints01:20

Structural Classification of Joints

6.7K
Joints, also known as articulations, are classified based on their structural characteristics, i.e., based on whether the articulating surfaces of the adjacent bones are directly connected by fibrous connective tissue or cartilage, or whether the articulating surfaces contact each other within a fluid-filled joint cavity. These differences serve to divide the joints of the body into three structural classifications.
A fibrous joint is where the adjacent bones are united by fibrous connective...
6.7K
Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

424
A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
424

You might also read

Related Articles

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

Sort by
Same author

Slide Deformable Transformer for High-Precision LiDAR Point Cloud Compression.

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

NOTO: Noise-Tolerate Evidential Learning for Open-Set Cross-Modal Retrieval.

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

Energy-preserving shifted bipartite graph learning for unpaired large-scale multi-view clustering.

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

Consistent and Specific Hashing for image set classification.

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

Prototype Matching Learning for Incomplete Multi-view Clustering.

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

LSVC: A Lifelong Learning Approach for Stream-View Clustering.

IEEE transactions on neural networks and learning systems·2024
Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systems·2026
Same journal

CAFF-CIL: Causality-Aware Freedom Forgetting Approach for Class-Incremental Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Harmonic Autoencoding Framework for Multiple Tasks in Magnetic Particle Imaging Reconstruction.

IEEE transactions on neural networks and learning systems·2026
Same journal

A Survey on Human-Centric Voice-Face Multimodal Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Vision-Assisted Foundation Model for Solving Multitask Vehicle Routing Problems.

IEEE transactions on neural networks and learning systems·2026
Same journal

FP3O: Enabling Proximal Policy Optimization in Multiagent Cooperation With Parameter-Sharing Versatility.

IEEE transactions on neural networks and learning systems·2026
See all related articles

Related Experiment Video

Updated: Dec 21, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.2K

Simultaneous Global and Local Graph Structure Preserving for Multiple Kernel Clustering.

Zhenwen Ren, Quansen Sun

    IEEE Transactions on Neural Networks and Learning Systems
    |May 15, 2020
    PubMed
    Summary
    This summary is machine-generated.

    Structure-preserving multiple kernel clustering (SPMKC) enhances nonlinear clustering by preserving data structure in kernel space. This novel method optimizes kernel weights and learns adaptive structures, outperforming existing techniques.

    More Related Videos

    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
    05:12

    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

    Published on: January 16, 2019

    11.8K
    Modeling the Functional Network for Spatial Navigation in the Human Brain
    05:55

    Modeling the Functional Network for Spatial Navigation in the Human Brain

    Published on: October 13, 2023

    1.4K

    Related Experiment Videos

    Last Updated: Dec 21, 2025

    Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
    12:27

    Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

    Published on: February 15, 2017

    7.2K
    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
    05:12

    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

    Published on: January 16, 2019

    11.8K
    Modeling the Functional Network for Spatial Navigation in the Human Brain
    05:55

    Modeling the Functional Network for Spatial Navigation in the Human Brain

    Published on: October 13, 2023

    1.4K

    Area of Science:

    • Machine Learning
    • Data Mining
    • Computer Vision

    Background:

    • Multiple Kernel Learning (MKL) surpasses Single Kernel Learning (SKL) for nonlinear clustering by avoiding manual kernel selection.
    • Graph-based MKL subspace clustering integrates self-expression learning but often neglects crucial kernel-space graph structures.
    • Existing MKL methods fail to adequately preserve the global and local data structures within the kernel space.

    Purpose of the Study:

    • To introduce Structure-Preserving Multiple Kernel Clustering (SPMKC), a novel MKL approach.
    • To address the limitation of ignored graph structures in kernel space within prior MKL clustering methods.
    • To enhance clustering performance by preserving both global and local data structures in the kernel space.

    Main Methods:

    • SPMKC employs a new kernel affine weight strategy for optimal consensus kernel learning from a kernel pool.
    • It incorporates a kernel group self-expressiveness term to maintain global data structure.
    • A kernel adaptive local structure learning term preserves local data structure within the kernel space.

    Main Results:

    • SPMKC effectively preserves both global and local data structures in the kernel space.
    • The proposed method demonstrates superior clustering performance compared to state-of-the-art MKL clustering techniques.
    • SPMKC achieves improved results with a reduced computational cost.

    Conclusions:

    • SPMKC offers a significant advancement in MKL for nonlinear clustering tasks.
    • Preserving data structure within the kernel space is crucial for effective clustering.
    • The method shows strong potential for applications in image and text clustering.