I was following paper : Effective Latent Models for Binary Feedback in Recommender Systems by Maksims N. Volkovs and Guang Wei Yu.
It is for producing recommendation using model based approach, SVD by use of neighbor-hood similarity information from collaborative filtering approaches.
So basically the author instead of decomposing the user rating matrix R(M users * N songs)
as we do in SVD for recommendation, said to decompose user song prediction matrix S(M users * N songs)
or the sparse matrix S(M users * top-k predicted songs)
.
Thus we get,
Ur,$r,Vr = sklearn.utils.extmath.randomized_svd(', n_components = 1000)
where r = SVD rank = n_components.
And we do generate prediction using Ur
and Vr
:
S(u, v) = Ur(u, :) * Vr(v, :).T
where u = user, v = item v , T = transpose
I generated the S(M*top-k)
matrix using collaborative filtering approach and fed to randomized_svd
But the prediction generated by above approach, does not produce accuracy(truncated mAP@500
, performance measure I am using , mAP = 0.01), while the authors have produced good mAP of 0.14 for same kaggle million song challenge data.
It is a lot to ask to read the paper and tell what's wrong,but if someone has prior knowledge and can help me that would be great.