Results 91 to 100 of about 275,529 (157)
, 2022 Performance of static vs dynamic OpenMP-based ordered PageRank algorithm for link analysis. Unordered PageRank is the standard method of calculating PageRank (as given in the original PageRank paper by Larry Page et al.
Subhajit Sahu
core +1 more source
Collective List-Only Entity Linking: A Graph-Based Approach
IEEE Access, 2018 List-only entity linking (EL) is the task of mapping ambiguous mentions in texts to target entities in a group of entity lists. Different from traditional EL task, which leverages rich semantic relatedness in knowledge bases to improve linking accuracy ...
Weixin Zeng +3 more
doaj +1 more source
A Subgraph Retrieval Method for Complex Questions Based on Hybrid Semantics and Path Representation [PDF]
ITM Web of ConferencesCurrent subgraph retrieval methods generally fall into two categories: those that rely on semantic matching, which use only surface-level semantic information of relations and lack flexibility; and those based on personalized PageRank algorithms, which ...
Hao Jifei, Cheng Bo
doaj +1 more source
, 2021 Part of the report Adjusting Datatype of Rank vector and CSR Representation with PageRank. -- Performance of PageRank using 32-bit ints vs 64-bit ints for the CSR representation (pull, CSR).
Subhajit Sahu
core +1 more source
Fast algorithms for topk personalized pagerank queries [PDF]
, 2008 In entity-relation (ER) graphs (V,E), nodes V represent typed entities and edges E represent typed relations. For dynamic personalized PageRank queries, nodes are ranked by their steady-state probabilities obtained using the standard random surfer model.
Amit Pathak +5 more
core +1 more source
, 2022 Effect of using different values of tolerance with ordered PageRank algorithm for link analysis. Unordered PageRank is the standard way of computing PageRank computation, where two different rank vectors are maintained; one representing the current ranks
Subhajit Sahu
core +1 more source
Network Capacity Bound for Personalized PageRank in Multimodal Networks [PDF]
, 2023 In a former paper the concept of Bipartite PageRank was introduced and a theorem on the limit of authority flowing between nodes for personalized PageRank has been generalized. In this paper we want to extend those results to multimodal networks.
Kłopotek, M. A. +2 more
core
Inflow and outflow centrality: novel centrality metrics inspired by graph convolution
Applied Network ScienceCentrality metrics quantify a node’s importance within a network based on a node’s connectivity, path position, proximity to other nodes, or influence from neighbors.
Aram Papazian, Volkhard Helms
doaj +1 more source
Approximating personalized pagerank with minimal use of webgraph data
, 2006 . In this paper, we consider the problem of calculating fast and accurate ap-proximations to the personalized PageRank score of a webpage. We focus on techniques to improve speed by limiting the amount of web graph data we need to access.
David Gleich, Marzia Polito
core +1 more source
Alexandria Engineering JournalIn social e-commerce environments, recommendation systems face significant challenges due to sparse user ratings, and unreliable product quality signals caused by popularity bias.
Rongkun Gao +3 more
doaj +1 more source