ℓ_0-Motivated Low-Rank Sparse Subspace Clustering

by   Maria Brbic, et al.
Ruđer Bošković Institute

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 ℓ_1 norms are used to measure rank and sparsity. However, the use of nuclear and ℓ_1 norms leads to an overpenalized problem and only approximates the original problem. In this paper, we propose two ℓ_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 ℓ_0 quasi-norm regularized objective. Afterward, we introduce the Schatten-0 (S_0) and ℓ_0 regularized objective and approximate the proximal map of the joint solution using a proximal average method (S_0/ℓ_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/ℓ_0-LRSSC when compared to state-of-the-art methods.


page 1

page 9


Subspace clustering based on low rank representation and weighted nuclear norm minimization

Subspace clustering refers to the problem of segmenting a set of data po...

Efficient Proximal Mapping Computation for Unitarily Invariant Low-Rank Inducing Norms

Low-rank inducing unitarily invariant norms have been introduced to conv...

Subspace Learning and Imputation for Streaming Big Data Matrices and Tensors

Extracting latent low-dimensional structure from high-dimensional data i...

Tensor Laplacian Regularized Low-Rank Representation for Non-uniformly Distributed Data Subspace Clustering

Low-Rank Representation (LRR) highly suffers from discarding the localit...

Constrained Low-Rank Learning Using Least Squares-Based Regularization

Low-rank learning has attracted much attention recently due to its effic...

Robust Multi-subspace Analysis Using Novel Column L0-norm Constrained Matrix Factorization

We study the underlying structure of data (approximately) generated from...

Representer Point Selection for Explaining Regularized High-dimensional Models

We introduce a novel class of sample-based explanations we term high-dim...

Please sign up or login with your details

Forgot password? Click here to reset