search

sknetwork-team / scikit-network

Graph Algorithms
Other
606 stars 66 forks source link

PageRank-based recommendations #534

Closed levrone1987 closed 2 years ago

levrone1987 commented 2 years ago

scikit-network version: 0.26.0 Python version: 3.8 Operating System: Linux Mint

Description

I am using your PageRank-based recommender, described at: https://scikit-network.readthedocs.io/en/latest/use_cases/recommendation.html

What I Did

So, for each user, I want to return a number of recommendations. However, since the number of users and items is large, the pagerank algorithm walks over the whole graph, meaning it would be prohibitive to use the approach in inference time. Could I somehow limit the walk to a local portion of the graph, given that I only need top-10 items? I thought about extracting a local graph for each user, and then perform pagerank, but I'm not sure it this is a clever way (and how I would approach it). Do you have an idea on how I might achieve a speedup? Any suggestion is highly welcome.

tbonald commented 2 years ago

Thanks for your question. I'm moving it to Discussions #535.