返回
Subspace clustering via structure-enforced dictionary learning
DOI:10.1016/j.neucom.2019.07.025.png)
摘要
En 中文
Many real world data, which we deal with today, often have very high dimensions. These high-dimensional data can be seen as collections of data points from a union of low-dimensional subspaces. Subspace clustering, one solution to the high-dimensional data problem, refers to a method by which a set of data points is divided into multiple clusters by finding multiple subspaces that fit each cluster. Most existing subspace clustering approaches construct an affinity matrix using the self-representation model, which can propagate disturbing noisy information because even noisy data points are used to represent the data; then, they perform spectral clustering on the obtained affinity matrix, which contains the irrelevant information about noise or outliers. This paper proposes a novel subspace clustering method based on the structured sparse PCA-based dictionary learning. Our proposed method learns the reduced dimensional dictionary and coefficient matrices using the structural information as well as sparsity of data. Then, the affinity matrix is constructed from inner product of the learned dictionary coefficient vectors, which shows the correlation among data points. The experimental results on three benchmark datasets verify that the proposed method outperforms state-of-the-art subspace clustering methods. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Subspace clustering
Dimensionality reduction
Structured sparse PCA
Dictionary learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
A micromachined efficient parametric array loudspeaker with a wide radiation frequency band具有宽辐射频带的微机械高效参量阵列扬声器
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法

