Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel

DOI10.1016/j.ins.2019.10.058zbMath1457.62204OpenAlexW2982941363WikidataQ126863919 ScholiaQ126863919MaRDI QIDQ2660741

Xiaoqian Zhang, Wei Chen, Xinghua Feng, Huaijiang Sun, Zhigui Liu, Xuqian Xue

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

zbMATH Keywords

low-rank approximationsubspace clusteringcorrentropyadaptive kernel

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (max. 100)

Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation ⋮ Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms ⋮ Multi-objective soft subspace clustering in the composite kernel space ⋮ Robust subspace clustering based on automatic weighted multiple kernel learning ⋮ A high-order norm-product regularized multiple kernel learning framework for kernel optimization

Uses Software

• COIL-20

Cites Work

• Unnamed Item
• Exact minimum rank approximation via Schatten \(p\)-norm minimization
• A trace inequality of John von Neumann
• A survey on soft subspace clustering
• Low-rank local tangent space embedding for subspace clustering
• Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
• 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
• Nonconvex tensor rank minimization and its applications to tensor recovery
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• Correntropy: Properties and Applications in Non-Gaussian Signal Processing
• Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
• Robust Subspace Clustering With Complex Noise
• Weighted Schatten <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction
• Human Motion Segmentation via Robust Kernel Sparse Subspace Clustering
• Local Deep-Feature Alignment for Unsupervised Dimension Reduction
• Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery

This page was built for publication: Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel