An Improved Approach to the PageRank Problems | Zendy

Yue Xie | Zendy; TingZhu Huang | Zendy; Chun Wen | Zendy; Dean Wu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Improved Approach to the PageRank Problems

Author(s) -

Yue Xie,

TingZhu Huang,

Chun Wen,

Dean Wu

Publication year - 2013

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2013/438987

Subject(s) - pagerank , computer science , computation , hyperlink , theoretical computer science , partition (number theory) , graph , algorithm , web page , mathematics , combinatorics , world wide web

We introduce a partition of the web pages particularly suited to the PageRank problems in which the web link graph has a nested block structure. Based on the partition of the web pages, dangling nodes, common nodes, and general nodes, the hyperlink matrix can be reordered to be a more simple block structure. Then based on the parallel computation method, we propose an algorithm for the PageRank problems. In this algorithm, the dimension of the linear system becomes smaller, and the vector for general nodes in each block can be calculated separately in every iteration. Numerical experiments show that this approach speeds up the computation of PageRank

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research