Sciweavers

354 search results - page 2 / 71
» Top-k learning to rank: labeling, ranking and evaluation
Sort
View
NIPS
2004
13 years 6 months ago
Learning Preferences for Multiclass Problems
Many interesting multiclass problems can be cast in the general framework of label ranking defined on a given set of classes. The evaluation for such a ranking is generally given ...
Fabio Aiolli, Alessandro Sperduti
NAACL
2010
13 years 2 months ago
Learning Dense Models of Query Similarity from User Click Logs
The goal of this work is to integrate query similarity metrics as features into a dense model that can be trained on large amounts of query log data, in order to rank query rewrit...
Fabio De Bona, Stefan Riezler, Keith Hall, Massimi...
SIGIR
2008
ACM
13 years 4 months ago
Learning to rank with partially-labeled data
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...
Kevin Duh, Katrin Kirchhoff
ICCBR
2007
Springer
13 years 11 months ago
Label Ranking in Case-Based Reasoning
The problem of label ranking has recently been introduced as an extension of conventional classification in the field of machine learning. In this paper, we argue that label ran...
Klaus Brinker, Eyke Hüllermeier
ICTIR
2009
Springer
13 years 2 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette