Candidate Set Sampling for Evaluating Top-N Recommendation

September 21, 2023 Β· Declared Dead Β· πŸ› 2023 IEEE International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ngozi Ihemelandu, Michael D. Ekstrand arXiv ID 2309.11723 Category cs.IR: Information Retrieval Citations 2 Venue 2023 IEEE International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) Last Checked 4 months ago
Abstract
The strategy for selecting candidate sets -- the set of items that the recommendation system is expected to rank for each user -- is an important decision in carrying out an offline top-$N$ recommender system evaluation. The set of candidates is composed of the union of the user's test items and an arbitrary number of non-relevant items that we refer to as decoys. Previous studies have aimed to understand the effect of different candidate set sizes and selection strategies on evaluation. In this paper, we extend this knowledge by studying the specific interaction of candidate set selection strategies with popularity bias, and use simulation to assess whether sampled candidate sets result in metric estimates that are less biased with respect to the true metric values under complete data that is typically unavailable in ordinary experiments.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted