Fast multiple graphs learning for multi-view clustering
From MaRDI portal
Recommendations
- Low-rank tensor constrained co-regularized multi-view spectral clustering
- Enhanced tensor based embedding anchor learning for multi-view clustering
- Simultaneous multi-graph learning and clustering for multiview data
- Multi-view clustering via double spaces structure learning and adaptive multiple projection regression learning
- Multi-view clustering with graph regularized optimal transport
Cites work
- Beyond low-rank representations: orthogonal clustering basis reconstruction with optimized graph structure for multi-view spectral clustering
- Essential Tensor Learning for Multi-View Spectral Clustering
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3061616 (Why is no real title available?)
- Low-rank tensor constrained co-regularized multi-view spectral clustering
- Multiple graphs learning with a new weighted tensor nuclear norm
- On unifying multi-view self-representations for clustering by tensor multi-rank minimization
- Re-Weighted Discriminatively Embedded K -Means for Multi-View Clustering
Cited in
(6)- Robust multi-view graph clustering in latent energy-preserving embedding space
- Multi-view clustering with graph regularized optimal transport
- Simultaneous multi-graph learning and clustering for multiview data
- Adaptive KNN and graph-based auto-weighted multi-view consensus spectral learning
- Multi-view clustering via double spaces structure learning and adaptive multiple projection regression learning
- Enhanced tensor based embedding anchor learning for multi-view clustering
This page was built for publication: Fast multiple graphs learning for multi-view clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488728)
