The Application of Matrix Partitioning Algorithm in PageRank Computational Efficiency

Article Preview

Abstract:

With the vigorous development of the Internet information age, work efficiency can be improved by finding the information needed accurately and quickly. Therefore, it is of vital importance to make an ordering for the relevant information web pages that are provided by the Internet. This paper proposes a kind of PageRank algorithm based on matrix partitioning to complete the ordering of relevant information web pages and applies this algorithm in the calculation cases whose experimental results on the aspect of improving PageRank computational efficiency show matrix partitioning can reduce iterations and improve computational efficiency.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 998-999)

Pages:

939-942

Citation:

Online since:

July 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Maolin Tang, The introduction of a method by using a kind of quartered matrix to calculate n determinant, Journal of Wuhan Commercial Service College. 2(2007)1-4.

Google Scholar

[2] Jingming Hu, The application of partitioned matrix in calculating determinant, Journal of Hebei Engineering and Technical College. 4(2004)50-53.

Google Scholar

[3] Taher H. Haveliwala, Efficient Computation of PageRank, Stanford University taherh@db. standford. edu. 1999, 32: 4-6.

Google Scholar

[4] Xiukuan Chen, The review of web data mining, Journal of Shandong light industry institute. 23(2009) 23-28.

Google Scholar

[5] Herui Zhang, Higher mathematics, Higher Education Press. Beijing, 1999, pp.376-378.

Google Scholar