返回
Grouping points by shared subspaces for effective subspace clustering
DOI:10.1016/j.patcog.2018.05.027.png)
摘要
En 中文
Clusters may exist in different subspaces of a multidimensional dataset. Traditional full-space clustering algorithms have difficulty in identifying these clusters. Various subspace clustering algorithms have used different subspace search strategies. They require clustering to assess whether cluster(s) exist in a subspace. In addition, all of them perform clustering by measuring similarity between points in the given feature space. As a result, the subspace selection and clustering processes are tightly coupled. In this paper, we propose a new subspace clustering framework named CSSub (Clustering by Shared Subspaces). It enables neighbouring core points to be clustered based on the number of subspaces they share. It explicitly splits candidate subspace selection and clustering into two separate processes, enabling different types of cluster definitions to be employed easily. Through extensive experiments on synthetic and real-world datasets, we demonstrate that CSSub discovers non-redundant subspace clusters with arbitrary shapes in noisy data; and it significantly outperforms existing state-of-the-art subspace clustering algorithms. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Subspace clustering
Shared subspaces
Density-based clustering
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Distance metric learning for soft subspace clustering in composite kernel space
PATTERN RECOGNITION
IF7.6
Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH,DyOOH,HoOOH,ErOOH和YbOOH的水热制备和低温磁性
A feature group weighting method for subspace clustering of high-dimensional data一种高维数据子空间聚类的特征组加权方法
PATTERN RECOGNITION
IF7.6

