arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1609.06568cs.IR
收藏

论预期n-call@k与相关性与多样性权衡之间的数学关系

On the Mathematical Relationship between Expected n-call@k and the Relevance vs. Diversity Trade-off

Kar Wai Lim, Scott Sanner, Shengbo Guo

摘要:

先前已经注意到,n-call@k相关性目标的优化(即,基于集合的目标,如果k个集合中的至少n个文档是相关的,则为1,否则为0),对于较小的n,鼓励更多的结果集合多样化,但是该声明从未被正式量化。在这项工作中,我们明确地推导出预期的n-调用@k和相关性与多样性权衡之间的数学关系-通过偶然的取消在所产生的组合优化,我们表明权衡是一个简单而直观的函数n(特别是独立的结果集大小k e n),其中多样化增加n的方法1。

英文摘要:

It has been previously noted that optimization of the n-call@k relevance objective (i.e., a set-based objective that is 1 if at least n documents in a set of k are relevant, otherwise 0) encourages more result set diversification for smaller n, but this statement has never been formally quantified. In this work, we explicitly derive the mathematical relationship between expected n-call@k and the relevance vs. diversity trade-off --- through fortuitous cancellations in the resulting combinatorial optimization, we show the trade-off is a simple and intuitive function of n (notably independent of the result set size k e n), where diversification increases as n approaches 1.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑