Fusion Subspace Clustering for Incomplete Data

@article{Mahmood2022FusionSC,
  title={Fusion Subspace Clustering for Incomplete Data},
  author={U. Mahmood and Daniel Pimentel-Alarc'on},
  journal={ArXiv},
  year={2022},
  volume={abs/2205.10872}
}
—This paper introduces fusion subspace clustering , a novel method to learn low-dimensional structures that ap-proximate large scale yet highly incomplete data. The main idea is to assign each datum to a subspace of its own, and minimize the distance between the subspaces of all data, so that subspaces of the same cluster get fused together. Our method allows low, high, and even full-rank data; it directly accounts for noise, and its sample complexity approaches the information-theoretic limit… 

Figures from this paper

References

SHOWING 1-10 OF 83 REFERENCES
K-subspaces with missing data
TLDR
A fast algorithm is presented that combines GROUSE, an incremental matrix completion algorithm, and k-subspaces, the alternating minimization heuristic for solving the subspace clustering problem, and relies on a slightly more general projection theorem which is presented here.
Group-sparse subspace clustering with missing data
TLDR
Two novel methods for subspace clustering with missing data are described: (a) group-sparse sub- space clustering (GSSC), which is based on group-sparsity and alternating minimization, and (b) mixture subspace clusters (MSC) which models each data point as a convex combination of its projections onto all subspaces in the union.
Sparse Subspace Clustering with Missing Entries
TLDR
Two new approaches for subspace clustering and completion are proposed and evaluated, which all outperform the natural approach when the data matrix is high-rank or the percentage of missing entries is large.
High-Rank Matrix Completion and Clustering under Self-Expressive Models
TLDR
This work proposes efficient algorithms for simultaneous clustering and completion of incomplete high-dimensional data that lie in a union of low-dimensional subspaces and shows that when the data matrix is low-rank, the algorithm performs on par with or better than low-Rank matrix completion methods, while for high-rank data matrices, the method significantly outperforms existing algorithms.
Data-Dependent Sparsity for Subspace Clustering
TLDR
This paper argues that a certain data-dependent, non-convex penalty function can compensate for dictionary structure in a way that is especially germane to subspace clustering problems and demonstrates a form of invariance to feature-space transformations and affine translations that commonly disrupt existing methods.
Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
TLDR
The proposed S3C framework is based on expressing each data point as a structured sparse linear combination of all other data points, where the structure is induced by a norm that depends on the unknown segmentation and it is shown that both the structured sparse representation and the segmentation can be found via a combination of an alternating direction method of multipliers with spectral clustering.
The Information-Theoretic Requirements of Subspace Clustering with Missing Data
TLDR
To derive deterministic sampling conditions for SCMD, which give precise information-theoretic requirements and determine sampling regimes, a practical algorithm is given to certify the output of any SCMD method deterministically.
Robust Recovery of Subspace Structures by Low-Rank Representation
TLDR
It is shown that the convex program associated with LRR solves the subspace clustering problem in the following sense: When the data is clean, LRR exactly recovers the true subspace structures; when the data are contaminated by outliers, it is proved that under certain conditions LRR can exactly recover the row space of the original data.
Robust Subspace Clustering
TLDR
This paper introduces an algorithm inspired by sparse subspace clustering (SSC) to cluster noisy data, and develops some novel theory demonstrating its correctness.
Greedy Subspace Clustering
TLDR
The statistical analysis shows that the algorithms are guaranteed exact (perfect) clustering performance under certain conditions on the number of points and the affinity between subspaces, which are weaker than those considered in the standard statistical literature.
...
...