-
Notifications
You must be signed in to change notification settings - Fork 262
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
How to calcuate nDCG in this paper? #56
Comments
Hi,
The way to compute the NDCG doesn't look the correct one, the index starts with a 2, but if you see here on WikiPedia is
See also here the same problem |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
I'm wondering how to calcuate nDCG paper? 😕
Question: The nDCG calculation needs the link predictions of all unobserved items, but It is not tractable(because of sparse density). What is your nDCG protocol to reproduce the performance table in this paper as follows.
Your model predicts link preferences between user and item pairs.
nDCG needs item ranking lists for each user.
Your model predicts only test link.
If nDCG is calculated, all unobserved items' preferences should be predicted.
However, it takes too much time to predict all the items.
I am confusing while reviewing the NGCF paper.
Alternatively NeuCF model use Leave-one-out protocol as follows.
However, the paper(in NGCF) mentioned as follows.
So, I think the leave-one-out protocol is not used. I am very curious about how to reproduce nDCG in this paper.
The text was updated successfully, but these errors were encountered: