Data-Adaptive Low-Rank Sparse Subspace Clustering

Ivica Kopriva
2/14/2025
cs.LG

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Low-rank sparse subspace clustering (LRSSC) algorithms built on self-expressive model effectively capture both the global and local structure of the data. However, existing solutions, primarily based on proximal operators associated with Sp/Lp , p e {0, 1/2, 2/3, 1}, norms are not data-adaptive. In this work, we propose an LRSSC algorithm incorporating a data-adaptive surrogate for the S0/L0 quasi-norm. We provide a numerical solution for the corresponding proximal operator in cases where an analytical expression is unavailable. The proposed LRSSC algorithm is formulated within the proximal mapping framework, and we present theoretical proof of its global convergence toward a stationary point. We evaluate the performance of the proposed method on three well known datasets, comparing it against LRSSC algorithms constrained by Sp/Lp, p e {0, 1/2, 2/3, 1}, norms.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Exploring a Principled Framework for Deep Subspace Clustering

79% match1 repo182026

Robust Kernel Sparse Subspace Clustering

79% match2024

Accelerated sparse Kernel Spectral Clustering for large scale data clustering problems

79% match1 repo2023

A Unifying Family of Data-Adaptive Partitioning Algorithms

78% match2024

Interpretable label-free self-guided subspace clustering

78% match2024

Towards Robust Nonlinear Subspace Clustering: A Kernel Learning Approach

78% match2025

Cite this paper

@article{kopriva2025dataadaptive,
  title  = {Data-Adaptive Low-Rank Sparse Subspace Clustering},
  author = {Ivica Kopriva},
  year   = {2025},
  eprint = {2502.10106},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.10106v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.10106.svg)](https://codeofpaper.com/paper/2502.10106)

Discussion