pith. sign in

arxiv: 1510.04356 · v1 · pith:IPC2KBQZnew · submitted 2015-10-15 · 💻 cs.IT · cs.LG· math.IT· stat.ML

Group-Invariant Subspace Clustering

classification 💻 cs.IT cs.LGmath.ITstat.ML
keywords clusteringgroup-invariantsubspacesubspacesdataanalysisassumedcome
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.