38 search results - page 4 / 8 » Learning to Rank by Maximizing AUC with Linear Programming |
ML
2002
ACM
13 years 5 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
NIPS
2007
13 years 7 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
NIPS
1997
13 years 7 months ago
1997
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
FCSC
2007
13 years 5 months ago
2007
1 The techniques for image analysis and classi cation generally consider the image sample labels xed and without uncertainties. The rank regression problem is studied in this pape...