Sciweavers

137 search results - page 5 / 28
» New Regularized Algorithms for Transductive Learning
Sort
View
JMLR
2006
124views more  JMLR 2006»
14 years 9 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
CVPR
2008
IEEE
15 years 11 months ago
Segmentation by transduction
This paper addresses the problem of segmenting an image into regions consistent with user-supplied seeds (e.g., a sparse set of broad brush strokes). We view this task as a statis...
Florent Ségonne, Jean Ponce, Jean-Yves Audi...
ALT
2000
Springer
15 years 1 months ago
Computationally Efficient Transductive Machines
In this paper1 we propose a new algorithm for providing confidence and credibility values for predictions on a multi-class pattern recognition problem which uses Support Vector mac...
Craig Saunders, Alexander Gammerman, Volodya Vovk
MM
2005
ACM
134views Multimedia» more  MM 2005»
15 years 3 months ago
Graph based multi-modality learning
To better understand the content of multimedia, a lot of research efforts have been made on how to learn from multi-modal feature. In this paper, it is studied from a graph point ...
Hanghang Tong, Jingrui He, Mingjing Li, Changshui ...
JMLR
2012
12 years 12 months ago
Metric and Kernel Learning Using a Linear Transformation
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
Prateek Jain, Brian Kulis, Jason V. Davis, Inderji...