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: | Zeng, Yijie, Chen, Jichao, Li, Yue, Qing, Yuanyuan, Huang, Guang-Bin |
---|---|
其他作者: | School of Electrical and Electronic Engineering |
格式: | Article |
語言: | English |
出版: |
2022
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/160969 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Enhancing generalized spectral clustering with embedding Laplacian graph regularization
由: Zhang, Hengmin, et al.
出版: (2025) -
Cluster analysis on dynamic graphs
由: Wang, Yujing
出版: (2024) -
Ricochet: A family of unconstrained algorithms for graph clustering
由: Wijaya, D.T., et al.
出版: (2013) -
Graphs, Clustering and applications
由: DERRY TANTI WIJAYA
出版: (2019) -
ELM embedded discriminative dictionary learning for image classification
由: Zeng, Yijie, et al.
出版: (2022)