Robust low-rank kernel multi-view subspace clustering based on the Schatten p-norm and correntropy
From MaRDI portal
Publication:2201681
Recommendations
- Multiple kernel low-rank representation-based robust multi-view subspace clustering
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Joint correntropy metric weighting and block diagonal regularizer for robust multiple kernel subspace clustering
- Multi-view spectral clustering via robust local subspace learning
- Hyper-Laplacian regularized multi-view subspace clustering with low-rank tensor constraint
Cites work
- A survey on soft subspace clustering
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
- Consensus and complementarity based maximum entropy discrimination for multi-view classification
- Convex Sparse Spectral Clustering: Single-View to Multi-View
- Correntropy: Properties and Applications in Non-Gaussian Signal Processing
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Global convergence of splitting methods for nonconvex composite optimization
- Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity
- Human Motion Segmentation via Robust Kernel Sparse Subspace Clustering
- Local Deep-Feature Alignment for Unsupervised Dimension Reduction
- Lossy compression approach to subspace clustering
- Multi-view clustering based on graph-regularized nonnegative matrix factorization for object recognition
- Robust Subspace Clustering With Complex Noise
- Subspace clustering using a low-rank constrained autoencoder
Cited in
(17)- Hyper-Laplacian regularized multi-view subspace clustering with low-rank tensor constraint
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- Multiple kernel low-rank representation-based robust multi-view subspace clustering
- Joint specific and correlated information exploration for multi-view action clustering
- Landmark-based \(k\)-factorization multi-view subspace clustering
- Learning a consensus affinity matrix for multi-view clustering via subspaces merging on Grassmann manifold
- Consensus graph learning for auto-weighted multi-view projection clustering
- Nonlinear subspace clustering using non-convex Schatten-p norm regularization
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Attributed graph clustering with subspace stochastic block model
- Robust subspace clustering based on automatic weighted multiple kernel learning
- Multi-view cluster analysis with incomplete data to understand treatment effects
- Learning task-driving affinity matrix for accurate multi-view clustering through tensor subspace learning
- Joint correntropy metric weighting and block diagonal regularizer for robust multiple kernel subspace clustering
- Low-rank local tangent space embedding for subspace clustering
- Auto-weighted multi-view co-clustering with bipartite graphs
- Robust multi-view graph clustering in latent energy-preserving embedding space
This page was built for publication: Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201681)
