Kernel truncated regression representation for robust subspace clustering

Research output: Contribution to journalArticle

Authors

  • Liangli Zhen
  • Dezhong Peng
  • Wei Wang
  • Xin Yao

Colleges, School and Institutes

Abstract

Subspace clustering aims to group data points into multiple clusters of which each corresponds to one subspace. Most existing subspace clustering approaches assume that input data lie on linear subspaces. In practice, however, this assumption usually does not hold. To achieve nonlinear subspace clustering, we propose a novel method, called kernel truncated regression representation. Our method consists of the following four steps: 1) projecting the input data into a hidden space, where each data point can be linearly represented by other data points; 2) calculating the linear representation coefficients of the data representations in the hidden space; 3) truncating the trivial coefficients to achieve robustness and block-diagonality; and 4) executing the graph cutting operation on the coefficient matrix by solving a graph Laplacian problem. Our method has the advantages of a closed-form solution and the capacity of clustering data points that lie on nonlinear subspaces. The first advantage makes our method efficient in handling large-scale datasets, and the second one enables the proposed method to conquer the nonlinear subspace clustering challenge. Extensive experiments on six benchmarks demonstrate the effectiveness and the efficiency of the proposed method in comparison with current state-of-the-art approaches.

Details

Original languageEnglish
Pages (from-to)59-76
Number of pages18
JournalInformation Sciences
Volume524
Early online date12 Mar 2020
Publication statusPublished - Jul 2020

Keywords

  • kernel truncated regression, nonlinear subspace clustering, spectral clustering, kernel techniques