38 search results - page 3 / 8 » Learning to Rank by Maximizing AUC with Linear Programming |
AAAI
1998
15 years 14 days ago
1998
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
114
click to vote
JMLR
2012
13 years 1 months ago
2012
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
80
Voted
ICML
2008
IEEE
15 years 12 months ago
2008
IEEE
This paper introduces a novel machine learning model called multiple instance ranking (MIRank) that enables ranking to be performed in a multiple instance learning setting. The mo...
117
Voted
ACCV
2007
Springer
15 years 28 days ago
2007
Springer
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
NIPS
2000
15 years 13 days ago
2000
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...