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: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/160969 |