Robust low-rank kernel multi-view subspace clustering based on the Schatten p-norm and correntropy
DOI10.1016/J.INS.2018.10.049zbMATH Open1450.62077OpenAlexW2898401672WikidataQ129012672 ScholiaQ129012672MaRDI QIDQ2201681FDOQ2201681
Huaijiang Sun, Zhigui Liu, Yanmeng Li, Xiaoqian Zhang, Qiongjie Cui, Zhenwen Ren
Publication date: 29 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.10.049
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
Statistical aspects of information-theoretic topics (62B10) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Correntropy: Properties and Applications in Non-Gaussian Signal Processing
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
- Subspace clustering using a low-rank constrained autoencoder
- Multi-view clustering based on graph-regularized nonnegative matrix factorization for object recognition
- A survey on soft subspace clustering
- Consensus and complementarity based maximum entropy discrimination for multi-view classification
- Lossy compression approach to subspace clustering
- Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity
- Convex Sparse Spectral Clustering: Single-View to Multi-View
- 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 (16)
- Low-rank local tangent space embedding for subspace clustering
- Auto-weighted multi-view co-clustering with bipartite graphs
- 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
- Learning task-driving affinity matrix for accurate multi-view clustering through tensor subspace learning
- Robust subspace clustering based on automatic weighted multiple kernel learning
- Robust multi-view graph clustering in latent energy-preserving embedding space
- Joint specific and correlated information exploration for multi-view action clustering
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- Consensus graph learning for auto-weighted multi-view projection clustering
- Learning a consensus affinity matrix for multi-view clustering via subspaces merging on Grassmann manifold
- Attributed graph clustering with subspace stochastic block model
- Multi-view cluster analysis with incomplete data to understand treatment effects
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Landmark-based \(k\)-factorization multi-view subspace clustering
- Nonlinear subspace clustering using non-convex Schatten-p norm regularization
Uses Software
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)
