You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
If anyone know about it, please explain how to reproduce the nDCG. 🙏
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'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: