PathRank: Ranking nodes on a heterogeneous graph for flexible hybrid recommender systems. We present a flexible hybrid recommender system that can emulate collaborative-filtering, Content-based Filtering, context-aware recommendation, and combinations of any of these recommendation semantics. The recommendation problem is modeled as a problem of finding the most relevant nodes for a given set of query nodes on a heterogeneous graph. However, existing node ranking measures cannot fully exploit the semantics behind the different types of nodes and edges in a heterogeneous graph. To overcome the limitation, we present a novel random walk based node ranking measure, PathRank, by extending the Personalized PageRank algorithm. The proposed measure can produce node ranking results with varying semantics by discriminating the different paths on a heterogeneous graph. The experimental results show that our method can produce more diverse and effective recommendation results compared to existing approaches.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Shams, Bita; Haratizadeh, Saman: Sibrank: signed bipartite network analysis for neighbor-based collaborative ranking (2016)