Comparing Personalized Relevance Algorithms for Directed Graphs
We present an interactive Web platform that, given a directed graph , allows identifying the most relevant nodes related to a given query node. Besides well-established algorithms such as PageRank and Personalized PageRank, the demo includes Cyclerank, a novel algorithm that addresses some of their limitations by leveraging cyclic paths to compute personalized relevance scores. Our demo design ...
Index Terms—algorithms, directed graphs , personalized page-rank, cyclerank, wikipedia link graph , interactive dashboard I. INTRODUCTION The relevance of nodes within a graph can be computed globally, or in relation to some specific node. The latter is useful when identifying the nodes that are most relevant within a specific context.
Comparing Personalized Relevance Algorithms for Directed Graphs
relevance scores. Our demo design enables two use cases: (a) algorithm comparison, comparing the results obtained with different algorithms , and (b) dataset comparison, for exploring
An interactive Web platform that, given a directed graph , allows identifying the most relevant nodes related to a given query node, and a novel algorithm that addresses some of their limitations by leveraging cyclic paths to compute personalized relevance scores is presented.
Comparing Personalized Relevance Algorithms for Directed Graphs
Comparing Personalized Relevance Algorithms for Directed Graphs : Paper and Code. We present an interactive Web platform that, given a directed graph , allows identifying the most relevant nodes related to a given query node. Besides well-established algorithms such as PageRank and Personalized PageRank, the demo includes Cyclerank, a novel algorithm that addresses some of their limitations by ...
An interactive Web platform that, given a directed graph , allows identifying the most relevant nodes related to a given query node, and a novel algorithm that addresses some of their limitations by leveraging cyclic paths to compute personalized relevance scores is presented. We present an interactive Web platform that, given a directed graph , allows identifying the most relevant nodes related ...
Comparing Personalized Relevance Algorithms for Directed Graphs
Comparing Personalized Relevance Algorithms for Directed Graphs Cavalcanti L.; Consonni C.; Brugnara M.;Laniado D.; Montresor A. 2024-01-01 Scheda breve Scheda completa Scheda completa (DC) Anno di pubblicazione (Date of publication) 2024 Titolo del volume (Proceedings title) Proceedings of the 40th IEEE International Conference on Data Engineering, ICDE'24 Luogo di edizione (Place of ...
Bibliographic details on Comparing Personalized Relevance Algorithms for Directed Graphs .
Comparing Personalized Relevance Algorithms for Directed Graphs
We present an interactive Web platform that, given a directed graph , allows identifying the most relevant nodes related to a given query node. Besides well-established algorithms such as PageRank and Personalized PageRank, the demo includes Cyclerank, a novel algorithm that addresses some of their limitations by leveraging cyclic paths to compute personalized relevance scores. Our demo design ...
CycleRank , or there and back again: personalized relevance scores from cyclic paths on directed graphs September 2020 Proceedings of the Royal Society A 476 (2241):20190740 DOI: 10.1098/rspa.2019 ...