Sciweavers

1092 search results - page 5 / 219
» Convex Methods for Transduction
Sort
View
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Half Transductive Ranking
We study the standard retrieval task of ranking a fixed set of items given a previously unseen query and pose it as the half transductive ranking problem. The task is transductive...
Bing Bai, Jason Weston, David Grangier, Ronan Coll...
ICML
2005
IEEE
14 years 8 months ago
Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...
Xiaojin Zhu, John D. Lafferty
DAM
2008
91views more  DAM 2008»
13 years 7 months ago
The Newton Bracketing method for the minimization of convex functions subject to affine constraints
The Newton Bracketing method [9] for the minimization of convex functions f : Rn R is extended to affinely constrained convex minimization problems. The results are illustrated for...
Adi Ben-Israel, Yuri Levin
JMLR
2008
139views more  JMLR 2008»
13 years 7 months ago
Regularization on Graphs with Function-adapted Diffusion Processes
Harmonic analysis and diffusion on discrete data has been shown to lead to state-of-theart algorithms for machine learning tasks, especially in the context of semi-supervised and ...
Arthur D. Szlam, Mauro Maggioni, Ronald R. Coifman
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
13 years 9 months ago
Fast Multilevel Transduction on Graphs
The recent years have witnessed a surge of interest in graphbased semi-supervised learning methods. The common denominator of these methods is that the data are represented by the...
Fei Wang, Changshui Zhang