.png){kind=icon}
返回
Correlation Self-Expression Shrunk for Subspace Clustering
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2968075.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In subspace clustering, low-rank representation (LRR) is a nice recipe for learning a good affinity matrix of a set of unlabeled data by representing themselves under the low-rank constraint in order to subsequently couple with clustering methods to divide data into several groups. However, the underlying geometric structure within data is still insufficiently explored in LRR. For this reason, we propose a correlation self-expression shrunk (CSS) to refresh LRR with two novel insights: 1) the compound schatten p-norm instead of the nuclear norm which is used to induce adaptive affinity matrix by addressing the issues of both sparse and dense representation; 2) to model compact group structure and relieve side effect of the outliers, CSS designs a robust self-expression shrunk regularization to reduce the deviation of similar samples. Thus, CSS can reap the benefits of both insights to boost clustering performance. In addition, we optimize CSS in the frame of alternating direction multiplier method (ADMM) where each sub-problem has a closed-form solution. Experiments of image clustering on four datasets verify the efficacy of CSS against several baseline variants of LRR.
Keyword:
Adaptive loss
low-rank representation
schatten p-norm
shrunk pattern
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering用于子空间聚类的对偶图正则化潜在低秩表示
PREAI
分享收藏
查看更多内容