2018 search results - page 61 / 404 » Magnitude-preserving ranking algorithms |
157
click to vote
COCO
2009
Springer
16 years 18 days ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
148
click to vote
ICTAI
2006
IEEE
16 years 2 days ago
2006
IEEE
Existing work shows that classic decision trees have inherent deficiencies in obtaining a good probability-based ranking (e.g. AUC). This paper aims to improve the ranking perfor...
183
click to vote
ECML
2003
Springer
15 years 11 months ago
2003
Springer
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
149
click to vote
MM
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we propose a novel personalized ranking system for amateur photographs. Although some of the features used in our system are similar to previous work, new features,...
179
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Multimedia uploaded content is tagged and recommended by users of collaborative systems, resulting in informal classifications also known as folksonomies. Faceted web ranking has ...