A method may include obtaining interactions between users and items, and calculating, for each edge in a bipartite graph, an edge weight using an inverse of the degree of a user node connected to the edge and an inverse of the degree of an item node connected to the edge. The bipartite graph includes user nodes corresponding to the users and item nodes corresponding to the items. The method may further include identifying paths each including an edge connecting the target user node and a common item node, an edge connecting a neighboring user node and the common item node, and an edge connecting the neighboring user node and a neighboring item node. The method may further include calculating, using the edge weights calculated for the edges, scores for the paths, and recommending, to the target user and using the scores for the paths, a recommended item.