arrow
返回

Assessing Top-k Preferences

delete2021-05-05
delete19
PRE
AI
C
Charles L. A. Clarke *
A
Alexandra Vtyurina
M
Mark D. Smucker
DOI:10.1145/3451161delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Assessors make preference judgments faster and more consistently than graded judgments. Preference judgments can also recognize distinctions between items that appear equivalent under graded judgments. Unfortunately, preference judgments can require more than linear effort to fully order a pool of items, and evaluation measures for preference judgments are not as well established as those for graded judgments, such as NDCG. In this article, we explore the assessment process for partial preference judgments, with the aim of identifying and ordering the top items in the pool, rather than fully ordering the entire pool. To measure the performance of a ranker, we compare its output to this preferred ordering by applying a rank similarity measure. We demonstrate the practical feasibility of this approach by crowdsourcing partial preferences for the TREC 2019 Conversational Assistance Track, replacing NDCG with a new measure named compatibility. This new measure has its most striking impact when comparing modern neural rankers, where it is able to recognize significant improvements in quality that would otherwise be missed by NDCG.
Keyword:
Preference judgments
question answering
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

ACM Transactions on Information Systems 封面图
ACM Transactions on Information Systems
IF:
9.1
论文数:
1.2K
被引数:
4.7K

机构

U
University of Waterloo
学者数:
2.2W
论文数: 2.3W
被引数: 3.3W
引用论文

引用论文

A Similarity Measure for Indefinite Rankings
err2010-11-23
err503
PREAI
errWebber, William; Moffat, Alistair; Zobel, Justin
err分享
err收藏
Postnatal Development of Cochlear Function in the Mustached Bat,Pteronotus parnellii
err2003-10-01
err0
PREAI
errM. Kössl; E. Foeller; M. Drexl; M. Vater; E. Mora; F. Coro; I. J. Russell
err分享
err收藏
学者 查看更多内容