Similarity matrix framework for data from union of subspaces
From MaRDI portal
Recommendations
- Unions of subspaces for data modeling and subspace clustering
- Similarity classes and principal submatrices
- Subspace Recovery From Structured Union of Subspaces
- A dimension reduction scheme for the computation of optimal unions of subspaces
- Similarity processing in multi-observation data
- Similarity preserving low-rank representation for enhanced data representation and effective subspace learning
- Dimension independent similarity computation
- On the existence of optimal unions of subspaces for data modeling and clustering
Cites work
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- A Theory for Sampling Signals From a Union of Subspaces
- A decomposition theorem for frames and the Feichtinger Conjecture
- Filtrated algebraic subspace clustering
- Foundations of a multi-way spectral clustering framework for hybrid linear modeling
- Nearest \(q\)-flat to \(m\) points
- Non-orthogonal fusion frames and the sparsity of fusion frame operators
- Nonlinear least squares in \(\mathbb R^{N}\)
- Optimal non-linear models for sparsity and sampling
- Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering
- Robust Recovery of Signals From a Structured Union of Subspaces
- \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers
Cited in
(5)
This page was built for publication: Similarity matrix framework for data from union of subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723020)