.png){kind=icon}
返回
General Framework for Understanding Compressed Subspace Clustering Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/JSTSP.2018.2879743.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Subspace clustering (SC) refers to the problem of clustering unlabeled high-dimensional data into a union of low-dimensional linear subspaces. In many practical scenarios, one may have access to only the compressed data due to constraints of measurement or computation. In this paper, based on the recently proposed restricted isometric property of Gaussian random projection for low-dimensional subspaces, we propose a general framework for analyzing the performance of various subspace clustering algorithms when applied to the compressed data. Our framework captures the connection between the problems of compressed subspace clustering (CSC) and noisy subspace clustering. With the existing study on noisy SC, our framework makes it possible to easily extend the results in noisy SC to CSC. In this paper, we select the most commonly used subspace clustering algorithms, i.e., sparse SC (SSC), SSC-orthogonal matching pursuit (SSC-OMP), and thresholding based SC (TSC), as representatives and analyze their performance using the proposed framework. Our results are consistent with related work obtained by previous researchers, where our methodology is much more direct and has more universal implications. Finally, the practicability and efficiency of CSC are verified by numerical experiments.
Keyword:
Dimensionality reduction
Johnson-Lindenstrauss Lemma
random projection
restricted isometry property
unsupervised learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.9K
被引数:
1.1W
机构
引用论文
Copper ferrocyanide loaded track etched membrane: an effective cesium adsorbent负载亚铁氰化铜的径迹蚀刻膜: 一种有效的铯吸附剂
PREAI
分享收藏
Fabrication of a multi-stage plasma synthetic jet actuator using printed electronics.png)
AIP Advances
OAAI
AIP AdvancesIF0
OAAI分享收藏分享收藏Cross-Label Suppression: A Discriminative and Fast Dictionary Learning With Group RegularizationOAAI
OAAI分享收藏
查看更多内容