Clustering via adaptive and locality-constrained graph learning and unsupervised ELM
In this paper an effective graph learning method is proposed for clustering based on adaptive graph regularizations. Many graph learning methods focus on optimizing a global constraint on sparsity, low-rankness or weighted pair-wise distances, but they often fail to consider local connectivities. We...
Main Authors: | Zeng, Yijie, Chen, Jichao, Li, Yue, Qing, Yuanyuan, Huang, Guang-Bin |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/160969 |
Similar Items
-
Spatial–Spectral Constrained Adaptive Graph for Hyperspectral Image Clustering
by: Xing-Hui Zhu, et al.
Published: (2022-08-01) -
Auxiliary Graph for Attribute Graph Clustering
by: Wang Li, et al.
Published: (2022-10-01) -
Multiview Data Clustering with Similarity Graph Learning Guided Unsupervised Feature Selection
by: Ni Li, et al.
Published: (2023-11-01) -
Graph-Constrained Residual Self-Expressive Subspace Clustering Network for Hyperspectral Images
by: Kun Huang, et al.
Published: (2024-01-01) -
Dynamic Graph Clustering Learning for Unsupervised Diabetic Retinopathy Classification
by: Chenglin Yu, et al.
Published: (2023-10-01)