Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

PAMI
2008

favoriteEmaildiscussreport

139views more PAMI 2008»

A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets

13 years 4 months ago

A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets

Download www.umiacs.umd.edu

We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approximation for the error function, we reduce the computational complexity of each iteration of a conjugate gradient algorithm for learning ranking functions from O

Vikas C. Raykar, Ramani Duraiswami, Balaji Krishna

Real-time Traffic

PAMI 2008 | Ranking | Ranking Function | Training Data |

claim paper

Related Content

» Large Scale Online Learning of Image Similarity through Ranking

» Large Scale MaxMargin MultiLabel Classification with Priors

» Fast LargeScale TransformationInvariant Clustering

» An Incremental Subspace Learning Algorithm to Categorize Large Scale Text Data

» Gene prediction in metagenomic fragments A large scale machine learning approach

» Random Features for LargeScale Kernel Machines

» Learning to Predict Salient Regions from Disjoint and Skewed Training Sets

» Joint Feature Selection in Distributed Stochastic Learning for LargeScale Discriminative T...

» Large Scale Learning of Active Shape Models

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	PAMI
Authors	Vikas C. Raykar, Ramani Duraiswami, Balaji Krishnapuram

Comments (0)