A Nonconvex Implementation of Sparse Subspace Clustering: Algorithm and Convergence Analysis

A Nonconvex Implementation of Sparse Subspace Clustering: Algorithm and Convergence Analysis

Subspace clustering has been widely applied to detect meaningful clusters in high-dimensional data spaces. And the sparse subspace clustering (SSC) obtains superior clustering performance by solving a relaxed &#x2113;<sub>0</sub>-minimization problem with &#x2113;<sub>1<...

Full description

Bibliographic Details
Main Authors: Xiaoge Deng, Tao Sun, Peibing Du, Dongsheng Li
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Sparse subspace clustering
nonconvex approximation
ADMM
reweighted algorithms
Online Access:https://ieeexplore.ieee.org/document/9040629/

Internet

https://ieeexplore.ieee.org/document/9040629/

Similar Items