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 |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/160969 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Cluster analysis on dynamic graphs
by: Wang, Yujing
Published: (2024) -
Ricochet: A family of unconstrained algorithms for graph clustering
by: Wijaya, D.T., et al.
Published: (2013) -
Graphs, Clustering and applications
by: DERRY TANTI WIJAYA
Published: (2019) -
ELM embedded discriminative dictionary learning for image classification
by: Zeng, Yijie, et al.
Published: (2022) -
Automatic clustering for unsupervised risk diagnosis of vehicle driving for smart road
by: Shi, Xiupeng, et al.
Published: (2022)