# $\ell_0$-Motivated Low-Rank Sparse Subspace Clustering

**Authors:** Maria Brbi\'c, Ivica Kopriva

arXiv: 1812.06580 · 2018-12-18

## TL;DR

This paper introduces novel $	ext{	extonehalf}$-norm based regularizations for low-rank sparse subspace clustering, addressing limitations of traditional nuclear and $	ext{	extonehalf}$-norms, and demonstrates improved performance on synthetic and real datasets.

## Contribution

It proposes two $	ext{	extonehalf}$-norm based regularizations, GMC-LRSSC and $S_0/	ext{	extonehalf}$-LRSSC, with algorithms and convergence analysis, advancing subspace clustering methods.

## Key findings

- Outperforms state-of-the-art methods on synthetic data.
- Achieves better clustering accuracy on real-world datasets.
- Provides convergence guarantees for the proposed algorithms.

## Abstract

In many applications, high-dimensional data points can be well represented by low-dimensional subspaces. To identify the subspaces, it is important to capture a global and local structure of the data which is achieved by imposing low-rank and sparseness constraints on the data representation matrix. In low-rank sparse subspace clustering (LRSSC), nuclear and $\ell_1$ norms are used to measure rank and sparsity. However, the use of nuclear and $\ell_1$ norms leads to an overpenalized problem and only approximates the original problem. In this paper, we propose two $\ell_0$ quasi-norm based regularizations. First, the paper presents regularization based on multivariate generalization of minimax-concave penalty (GMC-LRSSC), which contains the global minimizers of $\ell_0$ quasi-norm regularized objective. Afterward, we introduce the Schatten-0 ($S_0$) and $\ell_0$ regularized objective and approximate the proximal map of the joint solution using a proximal average method ($S_0/\ell_0$-LRSSC). The resulting nonconvex optimization problems are solved using alternating direction method of multipliers with established convergence conditions of both algorithms. Results obtained on synthetic and four real-world datasets show the effectiveness of GMC-LRSSC and $S_0/\ell_0$-LRSSC when compared to state-of-the-art methods.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1812.06580/full.md

## Figures

7 figures with captions in the complete paper: https://tomesphere.com/paper/1812.06580/full.md

## References

93 references — full list in the complete paper: https://tomesphere.com/paper/1812.06580/full.md

---
Source: https://tomesphere.com/paper/1812.06580