| 稀疏子空间聚类综述 |
| |
| 引用本文： | 王卫卫,李小平,冯象初,王斯琪.稀疏子空间聚类综述[J].自动化学报,2015,41(8):1373-1384. |
| |
| 作者姓名： | 王卫卫 李小平 冯象初 王斯琪 |
| |
| 作者单位： | 1.西安电子科技大学数学与统计学院 西安 710126 |
| |
| 基金项目： | 国家自然科学基金(61472303, 61271294, 61379030, 61362029, 61301229)和中央高校基本科研业务费(NSIY21)资助 |
| |
| 摘 要： | 稀疏子空间聚类(Sparse subspace clustering, SSC)是一种基于谱聚类的数据聚类框架. 高维数据通常分布于若干个低维子空间的并上, 因此高维数据在适当字典下的表示具有稀疏性. 稀疏子空间聚类利用高维数据的稀疏表示系数构造相似度矩阵, 然后利用谱聚类方法得到数据的子空间聚类结果. 其核心是设计能够揭示高维数据真实子空间结构的表示模型, 使得到的表示系数及由此构造的相似度矩阵有助于精确的子空间聚类. 稀疏子空间聚类在机器学习、计算机视觉、图像处理和模式识别等领域已经得到了广泛的研究和应用, 但仍有很大的发展空间. 本文对已有稀疏子空间聚类方法的模型、算法和应用等方面进行详细阐述, 并分析存在的不足, 指出进一步研究的方向.
|
| 关 键 词： | 高维数据 子空间聚类 稀疏表示 低秩表示 |
| 收稿时间： | 2014-12-22 |
A Survey on Sparse Subspace Clustering |
| |
| WANG Wei-Wei,LI Xiao-Ping,FENG Xiang-Chu,WANG Si-Qi.A Survey on Sparse Subspace Clustering[J].Acta Automatica Sinica,2015,41(8):1373-1384. |
| |
| Authors: | WANG Wei-Wei LI Xiao-Ping FENG Xiang-Chu WANG Si-Qi |
| |
| Affiliation: | 1.School of Mathematics and Statistics, Xidian University, Xi'an 710126 |
| |
| Abstract: | Sparse subspace clustering (SSC) is a newly developed spectral clustering-based framework for data clustering. High-dimensional data usually lie in a union of several low-dimensional subspaces, which allows sparse representation of high-dimensional data with an appropriate dictionary. Sparse subspace clustering methods pursue a sparse representation of high-dimensional data and use it to build the affinity matrix. The subspace clustering result of the data is finally obtained by means of spectral clustering. The key to sparse subspace clustering is to design a good representation model which can reveal the real subspace structure of high-dimensional data. More importantly, the obtained representation coefficient and the affinity matrix are more beneficial to accurate subspace clustering. Sparse subspace clustering has been successfully applied to different research fields, including machine learning, computer vision, image processing, system identification and others, but there is still a vast space to develop. In this paper, the fundamental models, algorithms and applications of sparse subspace clustering are reviewed in detail. Limitations existing in available methods are analyzed. Problems for further research on sparse subspace clustering are discussed. |
| |
| Keywords: | High-dimensional data subspace clustering (SC) sparse representation low rank representation |
|
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
|
