Semi-supervised learning with max-margin graph cuts

Abstract

This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic function solution. We motivate the approach, compare it to existing work, and prove a bound on its generalization error. The quality of our solutions is evaluated on a synthetic problem and three UCI ML repository datasets. In most cases, we outperform manifold regularization of support vector machines, which is a state-of-the-art approach to semi-supervised max-margin learning.

Published at AISTATS 2010 (13th International Conference on Artificial Intelligence and Statistics)

Cited by in corpus (6)

• Adaptive Diffusions for Scalable Learning over Graphs
• Multitask Protein Function Prediction Through Task Dissimilarity
• Online Semi-Supervised Learning on Quantized Graphs
• Online semi-supervised perception: Real-time learning without explicit feedback
• Learning from a single labeled face and a stream of unlabeled data
• Semi-supervised Data Representation via Affinity Graph Learning