Active evaluation of ranking functions based on graded relevance

DOI10.1007/S10994-013-5372-5zbMATH Open1273.68380OpenAlexW2017882941MaRDI QIDQ374154FDOQ374154

Authors: Christoph Sawade, Steffen Bickel, Timo von Oertzen, Tobias Scheffer, Niels Landwehr 

Publication date: 22 October 2013

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-013-5372-5

Recommendations

• Ranking as function approximation
• Evaluating search engine relevance with click-based metrics
• Ranking -- use and usability
• Active sampling for class probability estimation and ranking
• Adaptive submodular ranking

zbMATH Keywords

rankinginformation retrievalactive evaluation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20) Knowledge representation (68T30)

Cites Work

• Random forests
• Title not available (Why is that?)
• Monte Carlo strategies in scientific computing
• Title not available (Why is that?)
• Statistical Analysis of Bayes Optimal Subset Ranking

Cited In (3)

• How to build high quality L2R training data: unsupervised compression-based selective sampling for learning to rank
• Evaluating search engine relevance with click-based metrics
• Model based comparison of discounted cumulative gain and average precision

Uses Software

• LambdaMART

This page was built for publication: Active evaluation of ranking functions based on graded relevance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q374154)