Affinity Learning Via Self-Supervised Diffusion for Spectral Clustering
Spectral clustering makes use of the spectrum of an input affinity matrix to segment data into disjoint clusters. The performance of spectral clustering depends heavily on the quality of the affinity matrix. Commonly used affinity matrices are constructed by either the Gaussian kernel or the self-ex...
Main Authors: | Jianfeng Ye, Qilin Li, Jinlong Yu, Xincheng Wang, Huaming Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9293293/ |
Similar Items
-
Robust Spectral Clustering Incorporating Statistical Sub-Graph Affinity Model
by: Zhenxian Lin, et al.
Published: (2022-06-01) -
K-MEAP: Generating Specified K Clusters with Multiple Exemplars by Efficient Affinity Propagation
by: Wang, Yangtao, et al.
Published: (2016) -
Affinity Matrix Learning Via Nonnegative Matrix Factorization for Hyperspectral Imagery Clustering
by: Yao Qin, et al.
Published: (2021-01-01) -
A Novel Approach for Cognitive Clustering of Parkinsonisms through Affinity Propagation
by: Alessia Sarica, et al.
Published: (2021-02-01) -
Multi-omics integration with weighted affinity and self-diffusion applied for cancer subtypes identification
by: Xin Duan, et al.
Published: (2024-01-01)