返回
Fast subspace segmentation via Random Sample Probing
DOI:10.1016/j.neucom.2018.08.054.png)
摘要
En 中文
Subspace segmentation is to group a given set of n data points into multiple clusters, with each cluster corresponding to a subspace. Prevalent methods such as Sparse Subspace Clustering (SSC) and Low-Rank Representation (LRR) are effective in terms of segmentation accuracy, but computationally inefficient while applying to gigantic datasets where n is very large as they possess a complexity of O (n(3)). In this paper, we propose an iterative method called Random Sample Probing (RANSP). In each iteration, RANSP finds the members of one subspace by randomly choosing a data point (called seed) at first, and then using Ridge Regression (RR) to retrieve the other points that belong to the same subspace as the seed. Such a procedure is repeated until all points have been classified. RANSP has a computational complexity of O(n) and can therefore handle large-scale datasets. Experiments on synthetic and real datasets confirm the effectiveness and efficiency of RANSP. (c) 2018 Elsevier B.V. All rights reserved.
Keyword:
Clustering
Subspace segmentation
Large-scale
Random Sample Probing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
RANDOM SAMPLE CONSENSUS - A PARADIGM FOR MODEL-FITTING WITH APPLICATIONS TO IMAGE-ANALYSIS AND AUTOMATED CARTOGRAPHY随机样本共识-模型拟合的范例,可应用于图像分析和自动制图
Evaluating the Interpersonal Needs Questionnaire: Comparison of the Reliability, Factor Structure, and Predictive Validity across Five Versions评估人际需求问卷: 五个版本的可靠性,因素结构和预测效度的比较
Erasing genomic imprinting memory in mouse clone embryos produced from day 11.5 primordial germ cells
Development
IF0

