Semi-Supervised Learning with Max-Margin Graph Cuts - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Semi-Supervised Learning with Max-Margin Graph Cuts

Michal Valko
Ling Huang

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-00642891 , version 1

Citer

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⟩
302 Consultations
123 Téléchargements

Partager

Gmail Facebook X LinkedIn More