Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
From MaRDI portal
Publication:2660741
Recommendations
- Robust subspace clustering
- Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
- Robust Subspace Clustering via Thresholding
- Subspace Clustering via Learning an Adaptive Low-Rank Graph
- A robust subspace clustering algorithm
- Multiple kernel low-rank representation-based robust multi-view subspace clustering
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
Cites work
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A survey on soft subspace clustering
- A trace inequality of John von Neumann
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
- Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
- Correntropy: Properties and Applications in Non-Gaussian Signal Processing
- Exact minimum rank approximation via Schatten \(p\)-norm minimization
- Global convergence of splitting methods for nonconvex composite optimization
- Human Motion Segmentation via Robust Kernel Sparse Subspace Clustering
- Joint correntropy metric weighting and block diagonal regularizer for robust multiple kernel subspace clustering
- Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
- Local Deep-Feature Alignment for Unsupervised Dimension Reduction
- Low-rank local tangent space embedding for subspace clustering
- Nonconvex tensor rank minimization and its applications to tensor recovery
- Robust Subspace Clustering With Complex Noise
- Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
- Weighted Schatten <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction
Cited in
(14)- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- Multiple kernel low-rank representation-based robust multi-view subspace clustering
- Kernel truncated regression representation for robust subspace clustering
- Multi-objective soft subspace clustering in the composite kernel space
- Robust Subspace Clustering via Thresholding
- Robust Subspace Discovery via Relaxed Rank Minimization
- Robust subspace segmentation via nonconvex low rank representation
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- Robust subspace clustering based on automatic weighted multiple kernel learning
- Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
- Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
- A rank-constrained matrix representation for hypergraph-based subspace clustering
- Joint correntropy metric weighting and block diagonal regularizer for robust multiple kernel subspace clustering
- A high-order norm-product regularized multiple kernel learning framework for kernel optimization
This page was built for publication: Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2660741)
