On the mathematical relationship between expected n-call@k and the relevance vs. diversity trade-off

Kar Wai Lim*, Scott Sanner, Shengbo Guo

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publicationSIGIR'12 - Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval
    Pages1117-1118
    Number of pages2
    DOIs
    Publication statusPublished - 2012
    Event35th Annual ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2012 - Portland, OR, United States
    Duration: 12 Aug 201216 Aug 2012

    Publication series

    NameSIGIR'12 - Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval

    Conference

    Conference35th Annual ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2012
    Country/TerritoryUnited States
    CityPortland, OR
    Period12/08/1216/08/12

    Fingerprint

    Dive into the research topics of 'On the mathematical relationship between expected n-call@k and the relevance vs. diversity trade-off'. Together they form a unique fingerprint.

    Cite this