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...
Saved in:
Main Authors: | , , , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2022
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/160969 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|