• Home
  • Search
  • Autoencoder-Based Latent Block-Diagonal Representation for Subspace Clustering.
  • Cite Icon24
  • https://doi.org/10.1109/tcyb.2020.3031666Copy DOI Icon

Autoencoder-Based Latent Block-Diagonal Representation for Subspace Clustering.

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Block-diagonal representation (BDR) is an effective subspace clustering method. The existing BDR methods usually obtain a self-expression coefficient matrix from the original features by a shallow linear model. However, the underlying structure of real-world data is often nonlinear, thus those methods cannot faithfully reflect the intrinsic relationship among samples. To address this problem, we propose a novel latent BDR (LBDR) model to perform the subspace clustering on a nonlinear structure, which jointly learns an autoencoder and a BDR matrix. The autoencoder, which consists of a nonlinear encoder and a linear decoder, plays an important role to learn features from the nonlinear samples. Meanwhile, the learned features are used as a new dictionary for a linear model with block-diagonal regularization, which can ensure good performances for spectral clustering. Moreover, we theoretically prove that the learned features are located in the linear space, thus ensuring the effectiveness of the linear model using self-expression. Extensive experiments on various real-world datasets verify the superiority of our LBDR over the state-of-the-art subspace clustering approaches.

Similar Papers
  • Conference Article
  • Citations196

Self-Supervised Convolutional Subspace Clustering Network

  • Jun 01, 2019
  • Junjian Zhang +6
  • Conference Article
  • Citations28

Scalable density-based subspace clustering

  • Oct 24, 2011
  • Emmanuel Müller +3
  • Conference Article
  • Citations2

On Sparsity Measures In Deep Subspace Clustering

  • Mar 01, 2022
  • Samiran Das +2
  • Research Article
  • Citations32

Kernelized multi-view subspace clustering via auto-weighted graph learning

  • May 10, 2021
  • Applied Intelligence
  • Guang-Yu Zhang +5
  • Research Article
  • Citations17

Tensorized Incomplete Multi-view Kernel Subspace Clustering

  • Jul 09, 2024
  • Neural Networks
  • Guang-Yu Zhang +2
  • Research Article
  • Citations6

Feature Selection Embedded Robust K-Means

  • Jan 01, 2020
  • IEEE Access
  • Qian Zhang +1
  • Research Article
  • Citations10

Nonlinear subspace clustering by functional link neural networks

  • Oct 05, 2024
  • Applied Soft Computing
  • Long Shi +4
  • Research Article

Tensorized Multi-View Subspace Clustering via Tensor Nuclear Norm and Block Diagonal Representation

  • Aug 22, 2025
  • Mathematics
  • Gan-Yi Tang +3
  • Conference Article
  • Citations45

Multi-Level Representation Learning for Deep Subspace Clustering

  • Mar 01, 2020
  • Mohsen Kheirandishfard +2
  • Research Article
  • Citations23

Simultaneous Subspace Clustering and Cluster Number Estimating Based on Triplet Relationship.

  • Mar 06, 2019
  • IEEE Transactions on Image Processing
  • Jie Liang +4
  • Conference Article
  • Citations11

Tensor LRR based subspace clustering

  • Jul 01, 2014
  • Yifan Fu +3
  • Conference Article
  • Citations37

Spectral-Spatial Clustering of Hyperspectral Image Based on Laplacian Regularized Deep Subspace Clustering

  • Jul 01, 2019
  • Meng Zeng +4
  • Research Article
  • Citations157

Deep Subspace Clustering.

  • Nov 30, 2020
  • IEEE Transactions on Neural Networks and Learning Systems
  • Xi Peng +4
  • Research Article
  • Citations45

Subspace clustering based on latent low rank representation with Frobenius norm minimization

  • Nov 16, 2017
  • Neurocomputing
  • Song Yu +1
  • Research Article
  • Citations67

Tensor LRR and Sparse Coding-Based Subspace Clustering.

  • Apr 27, 2016
  • IEEE Transactions on Neural Networks and Learning Systems
  • Yifan Fu +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.