Low-rank sparse subspace for spectral clustering
The current two-step clustering methods separately learn the similarity matrix and conduct k means clustering. Moreover, the similarity matrix is learnt from the original data, which usually contain noise. As a consequence, these clustering methods cannot achieve good clustering results. To address...
Saved in:
Main Authors: | ZHU, Xiaofeng, ZHANG, Shichao, LI, Yonggang, ZHANG, Jilian, YANG, Lifeng, FANG, Yue |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2019
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4093 https://ink.library.smu.edu.sg/context/sis_research/article/5096/viewcontent/08417928.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Robust low-rank subspace segmentation with semidefinite guarantees
by: Ni, Y., et al.
Published: (2013) -
Salience-Aware Adaptive Resonance Theory for Large-Scale Sparse Data Clustering
by: Lei Meng, et al.
Published: (2020) -
Pairwise sparsity preserving embedding for unsupervised subspace learning and classification
by: Zhang, Z., et al.
Published: (2014) -
Efficient mining of distance-based subspace clusters
by: Liu, G., et al.
Published: (2013) -
Learning with ℓ1-graph for image analysis
by: Cheng, B., et al.
Published: (2014)