1016 search results - page 3 / 204 » Generalized distances between rankings |
COLT
2005
Springer
13 years 11 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
CIKM
2009
Springer
13 years 12 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
We introduce the notion of conservative edit distance and mapping between two RNA stem-loops. We show that unlike the general edit distance between RNA secondary structures, the co...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
A relationship between generalization error and training samples in kernel regressors is discussed in this paper. The generalization error can be decomposed into two components. On...
SDM
2007
SIAM
13 years 6 months ago
2007
SIAM
The problem of combining the ranked preferences of many experts is an old and surprisingly deep problem that has gained renewed importance in many machine learning, data mining, a...