Semi-supervised learning using greedy Max-Cut
From MaRDI portal
Recommendations
Cited in
(17)- A graph-based semi-supervised \(k\) nearest-neighbor method for nonlinear manifold distributed data classification
- Fast Distributed Approximation for Max-Cut
- Distributed and asynchronous methods for semi-supervised learning
- Graph-based semi-supervised learning
- Semi-supervised learning with local and global consistency
- Distributed minimum error entropy algorithms
- Graph transduction as a noncooperative game
- Graph transduction as a non-cooperative game
- Balanced graph based semi-supervised learning method
- On Data Integration Problems With Manifolds
- Adaptive non-negative projective semi-supervised learning for inductive classification
- Multiple graph regularized graph transduction via greedy gradient Max-Cut
- A survey on semi-supervised learning
- Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent
- scientific article; zbMATH DE number 6129872 (Why is no real title available?)
- Video semantic analysis based on structure-sensitive anisotropic manifold ranking
- Graph-based semi-supervised learning by mixed label propagation with a soft constraint
This page was built for publication: Semi-supervised learning using greedy Max-Cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405265)