arrow
Return

Subspace Clustering via Structured Sparse Relation Representation

delete2022-09-01
delete19
PRE
AI
L
Lai Wei *
F
Fenfen Ji
H
Hao Liu
周日贵 cover
周日贵 (Ri‐Gui Zhou)
朱
朱昌明 (Changming Zhu)
X
Xiafen Zhang
DOI:10.1109/TNNLS.2021.3059511delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Due to the corruptions or noises that existed in real-world data sets, the affinity graphs constructed by the classical spectral clustering-based subspace clustering algorithms may not be able to reveal the intrinsic subspace structures of data sets faithfully. In this article, we reconsidered the data reconstruction problem in spectral clustering-based algorithms and proposed the idea of ``relation reconstruction.'' We pointed out that a data sample could be represented by the neighborhood relation computed between its neighbors and itself. The neighborhood relation could indicate the true membership of its corresponding original data sample to the subspaces of a data set. We also claimed that a data sample's neighborhood relation could be reconstructed by the neighborhood relations of other data samples; then, we suggested a much different way to define affinity graphs consequently. Based on these propositions, a sparse relation representation (SRR) method was proposed for solving subspace clustering problems. Moreover, by introducing the local structure information of original data sets into SRR, an extension of SRR, namely structured sparse relation representation (SSRR) was presented. We gave an optimization algorithm for solving SRR and SSRR problems and analyzed its computation burden and convergence. Finally, plentiful experiments conducted on different types of databases showed the superiorities of SRR and SSRR.
Keywords:
Clustering algorithms
Sparse matrices
Image reconstruction
Optimization
Faces
Convergence
Task analysis
Low-rank representation (LRR)
neighborhood relation
sparse subspace clustering (SSC)
subspace clustering
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Neural Networks and Learning Systems cover
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
Papers:
7.6K
Citations:
7.2W

Organization

S
Shanghai Maritime University
Scholars:
4.8K
Papers: 4.2K
Citations: 4.7K
Cited Papers

Cited Papers

Constructing a Nonnegative Low-Rank and Sparse Graph With Data-Adaptive Features
err2015-11-01
err96
errOAAI
errZhuang, Liansheng; Gao, Shenghua; Tang, Jinhui; Wang, Jingjing; Lin, Zhouchen; Ma, Yi; Yu, Nenghai
errShare
errSave
Increase of central nitric oxide during pentylenetetrazol‐induced seizures in rats
err2008-06-28
err0
PREAI
errHIDEKATSU YOKOYAMA; NORIO MORI; KOUICHI OSONOE; NAHOKO KASAI; MIDORI HIRAMATSU; TETSUHIKO YOSHIMURA; TOMOKAZU MATSUE; ISAMU UCHIDA; NAGAO KOBAYASHI; NOBUAKI TSUCHIHASHI; SHIN‐ICHI NIWA
errShare
errSave
errShare
errSave
Structure-Constrained Low-Rank Representation
err2014-12-01
err137
PREAI
errTang, Kewei; Liu, Risheng; Su, Zhixun; Zhang, Jie
errShare
errSave
errShare
errSave
Regular Exercise Prolongs Survival in a Type 2 Spinal Muscular Atrophy Model Mouse
err2005-08-17
err0
errOAAI
errClément Grondard; Olivier Biondi; Anne-Sophie Armand; Sylvie Lécolle; Bruno Della Gaspera; Claude Pariset; Hung Li; Claude-Louis Gallien; Pierre-Paul Vidal; Christophe Chanoine; Frédéric Charbonnier
errShare
errSave
researcher View more