Adjusting PageRank parameters and Comparing results

08/06/2021
by   Subhajit Sahu, et al.
0

The effect of adjusting damping factor α and tolerance τ on iterations needed for PageRank computation is studied here. Relative performance of PageRank computation with L1, L2, and L∞ norms used as convergence check, are also compared with six possible mean ratios. It is observed that increasing the damping factor α linearly increases the iterations needed almost exponentially. On the other hand, decreasing the tolerance τ exponentially decreases the iterations needed almost exponentially. On average, PageRank with L∞ norm as convergence check is the fastest, quickly followed by L2 norm, and then L1 norm. For large graphs, above certain tolerance τ values, convergence can occur in a single iteration. On the contrary, below certain tolerance τ values, sensitivity issues can begin to appear, causing computation to halt at maximum iteration limit without convergence. The six mean ratios for relative performance comparison are based on arithmetic, geometric, and harmonic mean, as well as the order of ratio calculation. Among them GM-RATIO, geometric mean followed by ratio calculation, is found to be most stable, followed by AM-RATIO.

READ FULL TEXT
research
08/09/2021

Effect of stepwise adjustment of Damping factor upon PageRank

The effect of adjusting damping factor α, from a small initial value α0 ...
research
01/25/2019

The conjugate gradient algorithm on well-conditioned Wishart matrices is almost deteriministic

We prove that the number of iterations required to solve a random positi...
research
06/17/2018

Geometric mean extension for data sets with zeros

There are numerous examples in different research fields where the use o...
research
09/23/2013

Smooth minimization of nonsmooth functions with parallel coordinate descent methods

We study the performance of a family of randomized parallel coordinate d...
research
03/24/2023

Consistent ANOVA-type tests for various effect sizes

Analysis of variance (ANOVA) reveals some disadvantages, such as non-rob...
research
06/29/2019

Robust Linear Discriminant Analysis Using Ratio Minimization of L1,2-Norms

As one of the most popular linear subspace learning methods, the Linear ...
research
12/03/2018

Analysis of Geometric Selection of the Data-Error Covariance Inflation for ES-MDA

The ensemble smoother with multiple data assimilation (ES-MDA) is becomi...

Please sign up or login with your details

Forgot password? Click here to reset