Multi-view clustering with graph regularized optimal transport
From MaRDI portal
Recommendations
- Robust multi-view clustering with hyper-Laplacian regularization
- Adaptive KNN and graph-based auto-weighted multi-view consensus spectral learning
- Fast multiple graphs learning for multi-view clustering
- Fine-grained similarity fusion for multi-view spectral clustering
- Simultaneous multi-graph learning and clustering for multiview data
Cites work
- Accelerated manifold embedding for multi-view semi-supervised classification
- Auto-Weighted Multi-View Learning for Image Clustering and Semi-Supervised Classification
- Deep low-rank subspace ensemble for multi-view clustering
- scientific article; zbMATH DE number 3061616 (Why is no real title available?)
- Learning robust affinity graph representation for multi-view clustering
- Multimodal Deep Autoencoder for Human Pose Recovery
- Multiple partitions alignment via spectral rotation
Cited in
(8)- Fine-grained similarity fusion for multi-view spectral clustering
- Simultaneous multi-graph learning and clustering for multiview data
- Adaptive KNN and graph-based auto-weighted multi-view consensus spectral learning
- Fast multiple graphs learning for multi-view clustering
- Dual auto-weighted multi-view clustering via autoencoder-like nonnegative matrix factorization
- Geometric localized graph convolutional network for multi-view semi-supervised classification
- Enhanced tensor based embedding anchor learning for multi-view clustering
- Robust multi-view clustering with hyper-Laplacian regularization
This page was built for publication: Multi-view clustering with graph regularized optimal transport
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6125235)
