• Home
  • Search
  • Robust Subspace Clustering by Cauchy Loss Function.
  • Cite Icon94
  • https://doi.org/10.1109/tnnls.2018.2876327Copy DOI Icon

Robust Subspace Clustering by Cauchy Loss Function.

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

Subspace clustering is a problem of exploring the low-dimensional subspaces of high-dimensional data. State-of-the-art approaches are designed by following the model of spectral clustering-based method. These methods pay much attention to learn the representation matrix to construct a suitable similarity matrix and overlook the influence of the noise term on subspace clustering. However, the real data are always contaminated by the noise and the noise usually has a complicated statistical distribution. To alleviate this problem, in this paper, we propose a subspace clustering method based on Cauchy loss function (CLF). Particularly, it uses CLF to penalize the noise term for suppressing the large noise mixed in the real data. This is due to that the CLF's influence function has an upper bound that can alleviate the influence of a single sample, especially the sample with a large noise, on estimating the residuals. Furthermore, we theoretically prove the grouping effect of our proposed method, which means that highly correlated data can be grouped together. Finally, experimental results on five real data sets reveal that our proposed method outperforms several representative clustering methods.

Similar Papers
  • Conference Article
  • Citations63

Robust Subspace Clustering via Half-Quadratic Minimization

  • Dec 01, 2013
  • Yingya Zhang +3
  • Conference Article
  • Citations101

Correntropy Induced L2 Graph for Robust Subspace Clustering

  • Dec 01, 2013
  • Canyi Lu +5
  • Research Article
  • Citations56

Nonlinear subspace clustering for image clustering

  • Aug 19, 2017
  • Pattern Recognition Letters
  • Wencheng Zhu +2
  • Research Article
  • Citations10

Nonlinear subspace clustering by functional link neural networks

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

Subspace clustering using a symmetric low-rank representation

  • Mar 01, 2017
  • Knowledge-Based Systems
  • Jie Chen +3
  • Research Article
  • Citations1

Summarisation of subspace clusters based on similarity connectedness

  • Jan 01, 2018
  • International Journal of Data Science
  • B Jaya Lakshmi +2
  • Research Article
  • Citations157

Deep Subspace Clustering.

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

An Efficient Approach to Higher Dimensional Data Clustering

  • Dec 01, 2007
  • C Palanisamy +1
  • Conference Article
  • Citations196

Self-Supervised Convolutional Subspace Clustering Network

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

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

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

Block-diagonal structure learning for subspace clustering

  • Aug 01, 2025
  • Expert Systems with Applications
  • Zheng Xing +1
  • Conference Article
  • Citations1

Subspace Clustering via Joint Unsupervised Feature Selection

  • Jan 10, 2021
  • Wenhua Dong +4
  • Video Transcripts

Subspace Clustering via Joint Unsupervised Feature Selection

  • Dec 29, 2020
  • Underline Science Inc.
  • Wenhua Dong
  • Conference Article
  • Citations2

On Sparsity Measures In Deep Subspace Clustering

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

Attention reweighted sparse subspace clustering

  • Feb 21, 2023
  • Pattern Recognition
  • Libin Wang +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.