CycleRank, or there and back again: personalized relevance scores from cyclic paths on directed graphs.

ABSTRACT: Surfing the links between Wikipedia articles constitutes a valuable way to acquire new knowledge related to a topic by exploring its connections to other pages. In this sense, Personalized PageRank is a well-known option to make sense of the graph of links between pages and identify the most relevant articles with respect to a given one; its performance, however, is hindered by pages with high indegree that function as hubs and obtain high scores regardless of the starting point. In this work, we present CycleRank, a novel algorithm based on cyclic paths aimed at finding the most relevant nodes related to a topic. To compare the results of CycleRank with those of Personalized PageRank and other algorithms derived from it, we perform three experiments based on di

SUBMITTER: Consonni C 

PROVIDER: S-EPMC7544349 | biostudies-literature | 2020 Sep

REPOSITORIES: biostudies-literature