Sciweavers

131 search results - page 14 / 27
» Pairwise Preference Learning and Ranking
Sort
View
SIGIR
2008
ACM
13 years 10 months ago
Evaluation measures for preference judgments
There has been recent interest in collecting user or assessor preferences, rather than absolute judgments of relevance, for the evaluation or learning of ranking algorithms. Since...
Ben Carterette, Paul N. Bennett
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
14 years 10 days ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
CORR
2006
Springer
118views Education» more  CORR 2006»
13 years 11 months ago
Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs
Clickthrough data is a particularly inexpensive and plentiful resource to obtain implicit relevance feedback for improving and personalizing search engines. However, it is well kn...
Filip Radlinski, Thorsten Joachims
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 11 months ago
Learning optimal ranking with tensor factorization for tag recommendation
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
Steffen Rendle, Leandro Balby Marinho, Alexandros ...
CVPR
2010
IEEE
13 years 11 months ago
High performance object detection by collaborative learning of Joint Ranking of Granules features
Object detection remains an important but challenging task in computer vision. We present a method that combines high accuracy with high efficiency. We adopt simplified forms of...
Chang Huang, Ramakant Nevatia