.png){kind=icon}
返回
Subspace Clustering Through Parametric Representation and Sparse Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2014.2303122.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of recovering a finite number of linear subspaces from a collection of unlabeled data points that lie in the union of the subspaces. The data are such that it is not known which data point originates from which subspace. To address this challenge, we show that the clustering problem is amenable to a sparse optimization problem. Considering a candidate subspace and the distances of the data points to that subspace, the foundation of the proposed method lies in the maximization of the number of zero distances. This can be relaxed into a convex optimization. Efficiency of the relaxation can be significantly increased by solving a sequence of reweighted convex optimization problems.
Keyword:
Sparse optimization
subspace arrangement
subspace clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
RANDOM SAMPLE CONSENSUS - A PARADIGM FOR MODEL-FITTING WITH APPLICATIONS TO IMAGE-ANALYSIS AND AUTOMATED CARTOGRAPHY随机样本共识-模型拟合的范例，可应用于图像分析和自动制图
OAAI
OAAI分享收藏分享收藏Evaluating the Interpersonal Needs Questionnaire: Comparison of the Reliability, Factor Structure, and Predictive Validity across Five Versions评估人际需求问卷: 五个版本的可靠性，因素结构和预测效度的比较
PREAI
分享收藏
查看更多内容