A novel max-margin graph cut algorithm for semi-supervised learning outperforms manifold regularization SVM on most UCI and synthetic datasets while providing a generalization error bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Semi-supervised learning with max-margin graph cuts
A novel max-margin graph cut algorithm for semi-supervised learning outperforms manifold regularization SVM on most UCI and synthetic datasets while providing a generalization error bound.