Consensus multi-view spectral clustering network with unified similarity
Related Experiment Video
Updated: Jun 16, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
Published on: February 15, 2017
Yang Zhao1, Daidai Zhu2, Aihong Yuan3
1School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), Northwestern Polytechnical University, Xi'an, 710072, China; China and Shanghai Artificial Intelligence Laboratory, China and Shanghai Artificial Intelligence Laboratory, Shanghai, 200232, China; National Key Laboratory of Air-based Information Perception and Fusion, Luoyang, 471099, China.
Abstract:
The learning of a consensus representation is critical to multi-view spectral clustering, which generally involves two stages: affinity matrix construction from heterogeneous views and consensus embedding learning for clustering. However, most existing methods construct affinity matrices separately for each view, which hinders the learning of a unified similarity across views. Furthermore, limited attention has been paid to explicitly enforcing consistency among embedding representations, often resulting in suboptimal clustering performance. To address these issues, we propose an effective deep multi-view spectral clustering network to learn consensus representation. Specifically, we first propose a deep spectral embedding learning framework with unified similarity. This framework jointly integrates data to learn a unified similarity across multiple views, and further constructs a spectral mapping network to extract common embedding representations. To further learn sufficient consensus information, we align spectral embedding representations across different views using local structure-constrained contrastive learning. Different samples with high local similarity have their spectral embeddings constrained to be consistent, thus improving the clustering performance. Comparative experiments on eight public datasets validate the superiority and effectiveness of the proposed algorithm.
Related Concept Videos
Cluster Sampling Method
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...
Kendall's Coefficient of Concordance
Multicompartment Models: Overview
These models offer a more comprehensive representation of drug behavior in the body than one-compartment models. They accommodate the complexity of drug distribution,...
Aggregates Classification
Petrographic classification groups aggregates based on common mineralogical characteristics. Some of the common mineral groups found in aggregates are...
Modeling and Similitude
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...

