Results 81 to 90 of about 10,068 (229)
, 2022 Comparison of barrier vs barrier-free iterations with fixed iterations in OpenMP-based PageRank algorithm for link analysis. Unordered PageRank is the standard approach of PageRank computation (as described in the original paper by Larry Page et al. (1)),
Subhajit Sahu
core +1 more source
A multi-power and multi-splitting inner-outer iteration for PageRank computation
Open Mathematics, 2020 As an effective and possible method for computing PageRank problem, the inner-outer (IO) iteration has attracted wide interest in the past few years since it was first proposed by Gleich et al. (2010).
Pu Bing-Yuan, Wen Chun, Hu Qian-Ying
doaj +1 more source
Improved PageRank Influence Algorithm Based on User Behavior [PDF]
Jisuanji gongcheng, 2017 In the calculation of user influence,the PageRank algorithm considers only the following relation among users,which leads to the low accuracy of the calculation results.Therefore,a URank algorithm combining user behavior factors with PageRank algorithm ...
WANG Peng,WANG Zhen,LI Songjiang,ZHAO Jianping
doaj +1 more source
From Waste to Value: A Bibliometric‐Systematic Review of Biogas and Biomethane Business Literature
Corporate Social Responsibility and Environmental Management, EarlyView.ABSTRACT In response to escalating environmental challenges and the growing demand for sustainable energy solutions, the agri‐food sector is increasingly exploring business models grounded in circular economy (CE) principles based on the production of biogas and biomethane.
Silvia Cantele +3 more
wiley +1 more source
, 2022 Performance of static vs dynamic OpenMP-based PageRank algorithm for link analysis. Dynamic graphs, which change with time, have many applications. Computing ranks of vertices from scratch on every update (static PageRank) may not be good enough for an ...
Subhajit Sahu
core +1 more source
Axiomatization of the PageRank Centrality [PDF]
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018 We propose an axiomatization of PageRank. Specifically, we introduce five simple axioms—Foreseeability, Outgoing Homogeneity, Monotonicity, Merging, and Dummy Node—and show that PageRank is the only centrality measure that satisfies all of them. Our axioms give a new conceptual and theoretical underpinnings of PageRank and show how it differs from ...
Tomasz Was, Oskar Skibski
openaire +3 more sources
Toward Efficient Hub-Less Real Time Personalized PageRank
IEEE Access, 2017 In the era of big data, reduced models capable of reducing big data graph to estimate personalized PageRank are limited. Personalized PageRank is a page rank calculation where random jumps are only allowed to a subset of start nodes.
Matin Pirouz, Justin Zhan
doaj +1 more source
The Ranking Prediction of NBA Playoffs Based on Improved PageRank Algorithm
Complexity, 2021 It is of great significance to predict the results accurately based on the statistics of sports competition for participants research, commercial cooperation, advertising, and gambling profit.
Fan Yang, Jun Zhang
doaj +1 more source
Developmental Dynamics, EarlyView.Abstract Background The zebrafish heart regenerates upon injury. During injury response, fibroblasts and endothelial cells accumulate at the site of damage, and cardiomyocyte cell cycle reentry allows cardiac muscle regrowth. It is relevant to understand how the different cell types communicate with each other to coordinate regeneration.
João A. S. Carvalho +6 more
wiley +1 more source
, 2022 Effect of using different values of tolerance with barrier-free iterations in OpenMP-based ordered PageRank algorithm for link analysis. Unordered PageRank is the standard approach of PageRank computation (as described in the original paper by Larry Page
Subhajit Sahu
core +1 more source