Search Results for author:
Found 3 papers, 1 papers with code
EigenRec: Generalizing PureSVD for Effective and Efficient Top-N Recommendations
We introduce EigenRec; a versatile and efficient Latent-Factor framework for Top-N Recommendations that includes the well-known PureSVD algorithm as a special case.
Top-N recommendations in the presence of sparsity: An NCD-based approach
Making recommendations in the presence of sparsity is known to present one of the most challenging problems faced by collaborative filtering methods.
Random Surfing Without Teleportation
In the standard Random Surfer Model, the teleportation matrix is necessary to ensure that the final PageRank vector is well-defined.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
