Semi-Supervised Learning with Max-Margin Graph Cuts - Archive ouverte HAL Access content directly
Conference Papers Year :

Semi-Supervised Learning with Max-Margin Graph Cuts

(1) , (2) , (3) , (4)
1
2
3
4
Michal Valko
Ling Huang

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.
Fichier principal
Vignette du fichier
kveton2010semi-supervised.pdf (898.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00642891 , version 1 (19-11-2011)

Identifiers

  • HAL Id : hal-00642891 , version 1

Cite

Branislav Kveton, Michal Valko, Ali Rahimi, Ling Huang. Semi-Supervised Learning with Max-Margin Graph Cuts. International Conference on Artificial Intelligence and Statistics, May 2010, Chia Laguna, Sardinia, Italy. ⟨hal-00642891⟩
298 View
110 Download

Share

Gmail Facebook Twitter LinkedIn More