Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Extrapolation methods for multilinear PageRank
View through CrossRef
Abstract
Multilinear PageRank is a variant of the PageRank algorithm that takes into account multiple relationships among nodes in a network. This algorithm can make web page ranking more efficient and accurate by considering multiple types of connections at once. The higher-order power method is commonly used to calculate the multilinear PageRank vector due to its ease of implementation, low storage needs, and because it is a natural extension of the traditional power method used in the PageRank algorithm. However, the convergence of this method is not always guaranteed, and even if it is, it is slow. In this paper, we show how some vector extrapolation methods such as minimal polynomial extrapolation (MPE) and reduced rank extrapolation (RRE), could be used for accelerating the computation of the fixed-point multilinear PageRank.
Title: Extrapolation methods for multilinear PageRank
Description:
Abstract
Multilinear PageRank is a variant of the PageRank algorithm that takes into account multiple relationships among nodes in a network.
This algorithm can make web page ranking more efficient and accurate by considering multiple types of connections at once.
The higher-order power method is commonly used to calculate the multilinear PageRank vector due to its ease of implementation, low storage needs, and because it is a natural extension of the traditional power method used in the PageRank algorithm.
However, the convergence of this method is not always guaranteed, and even if it is, it is slow.
In this paper, we show how some vector extrapolation methods such as minimal polynomial extrapolation (MPE) and reduced rank extrapolation (RRE), could be used for accelerating the computation of the fixed-point multilinear PageRank.
Related Results
Comparison of PageRank Algorithm Implementations on a Single Computer
Comparison of PageRank Algorithm Implementations on a Single Computer
Pagerank Algorithm is an algorithm used for calculating web page ranking in Google search engine. Problem arises for Pagerank Algorithm due to big main memory usage, thus make it i...
Multilinear Stockwell transforms
Multilinear Stockwell transforms
The main aim of this paper is to introduce multilinear versions of the Stockwell transforms (also named S-transforms) by using the fact that S-transforms can be written as convolut...
Simple Hierarchical PageRank Graph Neural Networks
Simple Hierarchical PageRank Graph Neural Networks
Abstract
Graph neural networks (GNNs) have many variants for graph representation learning. Several works introduce PageRank into GNNs to improve its neighborhood aggregati...
Mapping topography and network of brain injury in patients with disorders of consciousness
Mapping topography and network of brain injury in patients with disorders of consciousness
Abstract
There is growing interest in the topography of brain regions associated with disorders of consciousness. This has caused increased research output, yieldin...
Two Parallel PageRank Algorithms via Improving Forward Push
Two Parallel PageRank Algorithms via Improving Forward Push
Abstract
PageRank, originally designed to rank web pages, has been widely applied in various fields. With the increasing scale of graphs, accelerating PageRank computation ...
Monte Carlo Based Personalized PageRank on Dynamic Networks
Monte Carlo Based Personalized PageRank on Dynamic Networks
In large-scale networks, the structure of the underlying network changes frequently, and thus the power iteration method for Personalized PageRank computation cannot deal with this...
Estimating the CCSD basis-set limit energy from small basis sets: basis-set extrapolations vs additivity schemes
Estimating the CCSD basis-set limit energy from small basis sets: basis-set extrapolations vs additivity schemes
Coupled cluster calculations with all single and double excitations (CCSD) converge exceedingly slowly with the size of the one-particle basis set. We assess the performance of a n...
Deep learning based spectral extrapolation for dual‐source, dual‐energy x‐ray computed tomography
Deep learning based spectral extrapolation for dual‐source, dual‐energy x‐ray computed tomography
PurposeData completion is commonly employed in dual‐source, dual‐energy computed tomography (CT) when physical or hardware constraints limit the field of view (FoV) covered by one ...