Sciweavers

3395 search results - page 393 / 679
» Learning to efficiently rank
Sort
View
ICML
2009
IEEE
16 years 7 months ago
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar
ICML
2007
IEEE
16 years 7 months ago
Exponentiated gradient algorithms for log-linear structured prediction
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
Amir Globerson, Terry Koo, Xavier Carreras, Michae...
ICML
2007
IEEE
16 years 7 months ago
Restricted Boltzmann machines for collaborative filtering
Most of the existing approaches to collaborative filtering cannot handle very large data sets. In this paper we show how a class of two-layer undirected graphical models, called R...
Ruslan Salakhutdinov, Andriy Mnih, Geoffrey E. Hin...
ICML
2008
IEEE
16 years 7 months ago
Graph kernels between point clouds
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
Francis R. Bach
ICML
2006
IEEE
16 years 7 months ago
Optimal kernel selection in Kernel Fisher discriminant analysis
In Kernel Fisher discriminant analysis (KFDA), we carry out Fisher linear discriminant analysis in a high dimensional feature space defined implicitly by a kernel. The performance...
Seung-Jean Kim, Alessandro Magnani, Stephen P. Boy...