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

14.0K
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...
14.0K
Chromatographic Resolution01:15

Chromatographic Resolution

2.0K
In chromatography, a solute moves through a chromatographic column and tends to spread, forming a Gaussian-shaped band. The longer the solute spends in the column, the broader the band becomes. The broadening can lead to overlaps within the column, affecting separation effectiveness.
The effectiveness of separation can be evaluated by determining the level of separation between two neighboring peaks in a chromatogram, which represents the individual components of a sample.
In chromatography,...
2.0K
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

4.6K
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...
4.6K
Modified Boxplots00:57

Modified Boxplots

10.8K
A standard box and whisker plot informs us about the spread of the data in a given sample. One can identify the minimum value, maximum value, first quartile value, second quartile or median value, and third quartile.
However, the box plot does not tell the reader about outliers - values that lie far from the center of the data. We can modify the standard box and whisker plot to identify the outliers and visualize the actual spread of the data in a sample.
Initially, we calculate the adjusted...
10.8K
¹³C NMR: Distortionless Enhancement by Polarization Transfer (DEPT)01:20

¹³C NMR: Distortionless Enhancement by Polarization Transfer (DEPT)

1.6K
When proton-coupled carbon-13 spectra are simplified by a broadband proton decoupling technique, structural information about the coupled protons is lost. Distortionless enhancement by polarization transfer (DEPT) is a technique that provides information on the number of hydrogens attached to each carbon in a molecule. While the DEPT experiment utilizes complex pulse sequences, the pulse delay and flip angle are specifically manipulated. The resulting signals have different phases depending on...
1.6K
Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule01:10

Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule

2.4K
In the AX proton spin system, proton A can sense the two spin states of a coupled proton X, resulting in a doublet NMR signal with two peaks of equal (1:1) intensity. When proton A is coupled to two equivalent protons (AX2 spin system), the spin states of each X can be aligned with or against the external field, creating three possible scenarios. This results in a 1:2:1  triplet signal, where the central peak corresponds to the chemical shift of A and is twice as large or intense as the...
2.4K

You might also read

Related Articles

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

Sort by
Same author

Robust Multi-View Clustering via Quadratic Matrix Factorization With Manifold Learning.

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

Nonprecious Metal-Modified Porous Organic Polymers for Enhanced Photocatalytic Degradation.

Langmuir : the ACS journal of surfaces and colloids·2026
Same author

Semi-supervised multi-label feature selection with consistent sparse graph learning.

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

NEF-DHR: A Non-Equivalent Functional Dynamic Heterogeneous Redundancy Architecture for Endogenous Safety and Security.

Entropy (Basel, Switzerland)·2026
Same author

Multidirectional lateral shearing random-step instantaneous phase-shifting interferometry for aspherical measurement.

Applied optics·2026
Same author

Scalable Semi-Supervised Learning With Discriminative Label Propagation and Correction.

IEEE transactions on pattern analysis and machine intelligence·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
Same journal

Self-Supervised Continuous Dynamic Graph Representation Learning via Hawkes Processes.

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

cPU: Consistent Risk Estimator for Positive-Unlabeled Learning.

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

Tuning-Free Latent Diffusion Models for Ultrahigh-Resolution Image Editing.

IEEE transactions on neural networks and learning systems·2026
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
See all related articles

Related Experiment Video

Updated: Jan 17, 2026

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
07:28

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

3.6K

Peak-Padding: Clustering by Padding Density Peaks With the Minimum Padding Cost.

Junyi Guan, Bingbing Jiang, Weiguo Sheng

    IEEE Transactions on Neural Networks and Learning Systems
    |September 19, 2025
    PubMed
    Summary
    This summary is machine-generated.

    The novel PeakPad algorithm effectively clusters complex shapes by padding density peaks, offering robust center detection and efficient handling of large datasets. This method enhances clustering performance on challenging data structures.

    More Related Videos

    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.3K
    Super-resolution Imaging of Neuronal Dense-core Vesicles
    09:30

    Super-resolution Imaging of Neuronal Dense-core Vesicles

    Published on: July 2, 2014

    10.1K

    Related Experiment Videos

    Last Updated: Jan 17, 2026

    JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
    07:28

    JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

    Published on: October 19, 2021

    3.6K
    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.3K
    Super-resolution Imaging of Neuronal Dense-core Vesicles
    09:30

    Super-resolution Imaging of Neuronal Dense-core Vesicles

    Published on: July 2, 2014

    10.1K

    Area of Science:

    • Data Science
    • Machine Learning
    • Artificial Intelligence

    Background:

    • Clustering complex-shaped clusters presents a significant challenge for existing algorithms.
    • Traditional methods struggle with intricate data structures, limiting their applicability.

    Purpose of the Study:

    • To introduce the peak-padding clustering algorithm (PeakPad) for improved clustering of complex-shaped data.
    • To address the limitations of current algorithms in detecting cluster centers within complex structures.

    Main Methods:

    • PeakPad clusters data by padding density peaks using a minimum padding cost.
    • It operates on a standardized 2D density-change (DC) density space, unlike mean-shift's high-dimensional approach.
    • The minimum padding cost assesses a density peak's center potential and inter-cluster associations.

    Main Results:

    • PeakPad demonstrates robust center detection performance, even on complex-shaped clusters.
    • The algorithm achieves fast and efficient clustering, suitable for large datasets.
    • Benchmark tests on synthetic and real datasets confirm PeakPad's effectiveness.

    Conclusions:

    • PeakPad offers a novel and effective solution for clustering complex-shaped data.
    • Its robust center detection and efficiency make it suitable for diverse applications.
    • The minimum padding cost is a key innovation for handling density peak associations.