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

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

12.0K
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...
12.0K
Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

234
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
234
Cluster Sampling Method01:20

Cluster Sampling Method

11.7K
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...
11.7K
Graphical and Analytic Representation of Sinusoids01:20

Graphical and Analytic Representation of Sinusoids

379
Analyzing two sinusoidal voltages with equal amplitude and period but different phases on an oscilloscope, an instrument used to display and analyze waveforms, involves a three-step process.
The first step is measuring the peak-to-peak value, which is twice the amplitude of the sinusoid. This provides information about the maximum voltage swing of the waveform.
Secondly, the period and angular frequency are determined. The period is the time taken for one complete cycle of the waveform, while...
379
Associative Learning01:27

Associative Learning

308
Associative learning is a fundamental concept in behavioral psychology, wherein a connection is established between two stimuli or events, leading to a learned response. This process is critical in understanding how behaviors are acquired and modified. Conditioning, the mechanism through which associations are formed, can be divided into two main types: classical conditioning and operant conditioning, each elucidating different aspects of associative learning.
Classical conditioning, also known...
308
Convolution Properties II01:17

Convolution Properties II

174
The important convolution properties include width, area, differentiation, and integration properties.
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
174

You might also read

Related Articles

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

Sort by
Same author

A Fluid Multivalent Magnetic Interface for High-Performance Isolation and Proteomic Profiling of Tumor-Derived Extracellular Vesicles.

Angewandte Chemie (International ed. in English)·2023
Same author

Synergetic collision and space separation in microfluidic chip for efficient affinity-discriminated molecular selection.

Proceedings of the National Academy of Sciences of the United States of America·2022
Same author

Reversible Immunoaffinity Interface Enables Dynamic Manipulation of Trapping Force for Accumulated Capture and Efficient Release of Circulating Rare Cells.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2021
Same author

Fluidic Multivalent Membrane Nanointerface Enables Synergetic Enrichment of Circulating Tumor Cells with High Efficiency and Viability.

Journal of the American Chemical Society·2020
Same author

DNA Framework-Programmed Cell Capture via Topology-Engineered Receptor-Ligand Interactions.

Journal of the American Chemical Society·2019
Same author

Supramolecular Transformation of Metallacycle-linked Star Polymers Driven by Simple Phosphine Ligand-Exchange Reaction.

Journal of the American Chemical Society·2018
Same journal

Granular Ball-Based Noise-Resistant Fuzzy Multineighborhood Feature Selection via Label Enhancement and Feature Graph.

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

Fighting Evolving Spam With ARTMAP Models: A Noise-Resilient Online Detection Framework.

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

HyperSAT: Unsupervised Hypergraph Neural Networks for Weighted MaxSAT Problems.

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

Negation of Basic Belief Assignment in Multisource Information Fusion on Dempster-Shafer Theory With Applications in Pattern Classification.

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

Intervention Feasible Region and Driver Risk Capacity Aware Human-Machine Collaborative Safe Trajectory Planning.

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

A Unified Differential Denoising Learning Framework With a Pre-Trained Model and Fuzzy Graph Networks for Drug-Drug Interaction Prediction.

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

Related Experiment Video

Updated: Jun 11, 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

6.9K

From Cluster Assumption to Graph Convolution: Graph-Based Semi-Supervised Learning Revisited.

Zheng Wang, Hongming Ding, Li Pan

    IEEE Transactions on Neural Networks and Learning Systems
    |October 7, 2024
    PubMed
    Summary
    This summary is machine-generated.

    Deep graph convolutional networks (GCNs) face oversmoothing, unlike traditional graph-based semi-supervised learning (GSSL). We propose new GSSL methods that better integrate graph structure and label information for improved performance.

    More Related Videos

    Statistical Modelling of Cortical Connectivity Using Non-invasive Electroencephalograms
    08:51

    Statistical Modelling of Cortical Connectivity Using Non-invasive Electroencephalograms

    Published on: November 1, 2019

    5.6K
    Measuring the Shape and Size of Activated Sludge Particles Immobilized in Agar with an Open Source Software Pipeline
    09:27

    Measuring the Shape and Size of Activated Sludge Particles Immobilized in Agar with an Open Source Software Pipeline

    Published on: January 30, 2019

    7.1K

    Related Experiment Videos

    Last Updated: Jun 11, 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

    6.9K
    Statistical Modelling of Cortical Connectivity Using Non-invasive Electroencephalograms
    08:51

    Statistical Modelling of Cortical Connectivity Using Non-invasive Electroencephalograms

    Published on: November 1, 2019

    5.6K
    Measuring the Shape and Size of Activated Sludge Particles Immobilized in Agar with an Open Source Software Pipeline
    09:27

    Measuring the Shape and Size of Activated Sludge Particles Immobilized in Agar with an Open Source Software Pipeline

    Published on: January 30, 2019

    7.1K

    Area of Science:

    • Artificial Intelligence
    • Machine Learning
    • Graph Neural Networks

    Background:

    • Graph-based semi-supervised learning (GSSL) is a key research area.
    • Traditional GSSL methods are shallow learners based on the cluster assumption.
    • Graph convolutional networks (GCNs) are recent, high-performing GSSL techniques.

    Purpose of the Study:

    • Investigate why deep GCNs suffer from oversmoothing, a problem not seen in traditional shallow GSSL.
    • Theoretically analyze the relationship between GCNs and traditional GSSL within a unified framework.
    • Propose novel GSSL methods to address limitations in current GCN approaches.

    Main Methods:

    • Developed a unified optimization framework to analyze GSSL methods.
    • Proposed three new graph convolution methods: optimized simple graph convolution (OSGC), graph structure preserving graph convolution (GSPGC), and its multiscale version (GGCM).
    • OSGC is supervised, guiding convolution with labels; GSPGC and GGCM are unsupervised, preserving graph structure.

    Main Results:

    • Identified that typical GCNs may not effectively incorporate both graph structure and label information at each layer.
    • Demonstrated the effectiveness of the proposed OSGC, GSPGC, and GGCM methods through extensive experiments.
    • The new methods show promise in mitigating the oversmoothing problem and enhancing GSSL performance.

    Conclusions:

    • Deep GCNs' oversmoothing issue is linked to how they integrate graph and label information.
    • The proposed supervised and unsupervised graph convolution methods offer effective alternatives.
    • These methods enhance GSSL by better utilizing graph structure and label data.