Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Cluster Sampling Method

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

Classification of Systems-II

Classification of Systems-II

Continuous-time systems have continuous input and output signals, with time measured continuously. These systems are generally defined by differential or algebraic equations. For instance, in an RC circuit, the relationship between input and output voltage is expressed through a differential equation derived from Ohm's law and the capacitor relation,

Extraction: Partition and Distribution Coefficients

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

Classification of Systems-I

Classification of Systems-I

Linearity is a system property characterized by a direct input-output relationship, combining homogeneity and additivity.
Homogeneity dictates that if an input x(t) is multiplied by a constant c, the output y(t) is multiplied by the same constant. Mathematically, this is expressed as:

Classification of Signals

Classification of Signals

In signal processing, signals are classified based on various characteristics: continuous-time versus discrete-time, periodic versus aperiodic, analog versus digital, and causal versus noncausal. Each category highlights distinct properties crucial for understanding and manipulating signals.
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...

Kendall's Coefficient of Concordance

Kendall's Coefficient of Concordance

Kendall's Coefficient of Concordance (W), also known as Kendall's W, is a non-parametric statistical measure used to assess the agreement or concordance between multiple raters or judges when they rank a set of items. It is often used when you have ordinal data (ranks) and you want to see if there is consistency or consensus among the raters. It is widely applied in research areas such as psychology, medicine, and social sciences, where multiple judges are asked to rank or rate subjects or...

You might also read

Related Articles

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

Sort by

Same author

Deep Kernel Principal Component Analysis for multi-level feature learning.

Neural networks : the official journal of the International Neural Network Society·2023

Same author

Learning With Asymmetric Kernels: Least Squares and Feature Interpretation.

IEEE transactions on pattern analysis and machine intelligence·2023

Same author

Disentangled Representation Learning and Generation With Manifold Optimization.

Neural computation·2022

Same author

Compressing Features for Learning With Noisy Labels.

IEEE transactions on neural networks and learning systems·2022

Same author

Towards a Unified Quadrature Framework for Large-Scale Kernel Machines.

IEEE transactions on pattern analysis and machine intelligence·2021

Same author

Unsupervised learning of disentangled representations in deep restricted kernel machines with orthogonality constraints.

Neural networks : the official journal of the International Neural Network Society·2021

Same journal

Dynamic analysis and reliable mechanical optimization application of ring HNN effected with a memristive neuron.

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

Same journal

DAFF-Net: A detection and search method for small-scale low surface brightness galaxies.

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

Same journal

Quasi-synchronization for complex networks with hybrid pinning intermittent control.

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

Same journal

Physics-encoded convolutional neural operators for parametric PDEs: A convergence-guaranteed framework via pre-computed kernel fields.

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

Same journal

Exploiting audio-visual modalities in videos: Object detection via multi-stage bilateral coupling network.

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

Same journal

Reliability-aware modality completion with cross-modal distillation for federated learning with missing modalities.

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

See all related articles

Search research articles

Related Experiment Video

Updated: May 19, 2026

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

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

Published on: February 15, 2017

Hierarchical kernel spectral clustering.

Carlos Alzate¹, Johan A K Suykens

¹Department of Electrical Engineering ESAT-SCD-SISTA, Katholieke Universiteit Leuven, Leuven, Belgium. carlos.alzate@esat.kuleuven.be

Neural Networks : the Official Journal of the International Neural Network Society

|August 18, 2012

Summary

This summary is machine-generated.

This study introduces a novel kernel spectral clustering method to uncover hierarchical data structures. The approach automatically determines optimal tree depth, enhancing model selection and data analysis.

More Related Videos

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

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

Published on: January 16, 2019

Related Experiment Videos

Last Updated: May 19, 2026

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

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

Published on: February 15, 2017

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

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

Published on: January 16, 2019

Area of Science:

Machine Learning
Data Mining
Computational Statistics

Background:

Kernel spectral clustering offers a powerful framework for data analysis by mapping data to high-dimensional spaces.
Existing methods may not fully exploit the hierarchical nature inherent in many datasets.
Model selection in clustering often requires careful parameter tuning.

Purpose of the Study:

To develop a methodology for revealing hierarchical structures within data using kernel spectral clustering.
To integrate model selection with the discovery of cluster hierarchies.
To automatically determine the optimal depth of the cluster hierarchy.

Main Methods:

The study employs a constrained optimization framework for kernel spectral clustering.
It involves solving an eigenvalue problem during training to define the clustering model.
Out-of-sample extensions are utilized for robust model selection.

Main Results:

A novel methodology is proposed to visualize and analyze hierarchical data structures.
The approach successfully combines model selection with hierarchy discovery.
Automatic determination of optimal tree depth was achieved and validated.

Conclusions:

The proposed kernel spectral clustering methodology effectively reveals underlying data hierarchies.
This approach offers significant benefits for model selection and understanding complex data structures.
Simulations on toy and real-world data demonstrate the practical advantages of the method.