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 fun...
Branislav Kveton, Michal Valko, Ali Rahimi, Ling H...
We propose a semi-supervised learning algorithm for discriminant analysis, which uses the geometric structure of both labeled and unlabeled samples and perform a manifold regulari...
We wish to endow the manifold M of smooth curves in lRn with a Riemannian metric that allows us to treat continuous morphs (homotopies) between two curves c0 and c1 as trajectorie...
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...