Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
From MaRDI portal
Publication:2660741
DOI10.1016/J.INS.2019.10.058zbMATH Open1457.62204OpenAlexW2982941363WikidataQ126863919 ScholiaQ126863919MaRDI QIDQ2660741FDOQ2660741
Authors: Xuqian Xue, Xiaoqian Zhang, Xinghua Feng, Huaijiang Sun, Wei Chen, Zhigui Liu 
Publication date: 31 March 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2019.10.058
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
- Title not available (Why is that?)
- Correntropy: Properties and Applications in Non-Gaussian Signal Processing
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
- A trace inequality of John von Neumann
- Exact minimum rank approximation via Schatten \(p\)-norm minimization
- Weighted Schatten <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction
- Global convergence of splitting methods for nonconvex composite optimization
- Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
- Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
- A survey on soft subspace clustering
- Nonconvex tensor rank minimization and its applications to tensor recovery
- Low-rank local tangent space embedding for subspace clustering
- Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
- Joint correntropy metric weighting and block diagonal regularizer for robust multiple kernel subspace clustering
- Local Deep-Feature Alignment for Unsupervised Dimension Reduction
- Human Motion Segmentation via Robust Kernel Sparse Subspace Clustering
- Robust Subspace Clustering With Complex Noise
Cited In (14)
- Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
- Joint correntropy metric weighting and block diagonal regularizer for robust multiple kernel subspace clustering
- Multiple kernel low-rank representation-based robust multi-view subspace clustering
- Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
- Robust Subspace Discovery via Relaxed Rank Minimization
- Robust subspace clustering based on automatic weighted multiple kernel learning
- Robust Subspace Clustering via Thresholding
- Robust subspace segmentation via nonconvex low rank representation
- Multi-objective soft subspace clustering in the composite kernel space
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- A high-order norm-product regularized multiple kernel learning framework for kernel optimization
- A rank-constrained matrix representation for hypergraph-based subspace clustering
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- Kernel truncated regression representation for robust subspace clustering
Uses Software
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)
