English

Group-Invariant Subspace Clustering

Information Theory 2015-10-16 v1 Machine Learning math.IT Machine Learning

Abstract

In this paper we consider the problem of group invariant subspace clustering where the data is assumed to come from a union of group-invariant subspaces of a vector space, i.e. subspaces which are invariant with respect to action of a given group. Algebraically, such group-invariant subspaces are also referred to as submodules. Similar to the well known Sparse Subspace Clustering approach where the data is assumed to come from a union of subspaces, we analyze an algorithm which, following a recent work [1], we refer to as Sparse Sub-module Clustering (SSmC). The method is based on finding group-sparse self-representation of data points. In this paper we primarily derive general conditions under which such a group-invariant subspace identification is possible. In particular we extend the geometric analysis in [2] and in the process we identify a related problem in geometric functional analysis.

Keywords

Cite

@article{arxiv.1510.04356,
  title  = {Group-Invariant Subspace Clustering},
  author = {Shuchin Aeron and Eric Kernfeld},
  journal= {arXiv preprint arXiv:1510.04356},
  year   = {2015}
}

Comments

Proceedings of Allerton 2015

R2 v1 2026-06-22T11:20:47.251Z