% This file was created with JabRef 2.5.
% Encoding: Cp1252

@INPROCEEDINGS{kveton2010semi--supervised,
  author = {Branislav Kveton and Michal Valko and Ali Rahimi and Ling Huang},
  title = {Semi--Supervised Learning with Max-Margin Graph Cuts},
  booktitle = {Proceedings of The Thirteenth International Conference on Artificial
	Intelligence and Statistics (AISTATS)},
  year = {2010},
  editor = {Y.W. Teh and M. Titterington},
  volume = {9},
  number = {W\&CP 9},
  pages = {421--428},
  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.},
  owner = {misovalko},
  timestamp = {2010.02.17}
}