A Novel Heuristic PageRank Algorithm in Web Search

Abstract:

Article Preview

With the booming development of the Internet, web search engines have become the most important Internet tools for retrieving information. PageRank computes the principal eigenvector of the matrix describing the hyperlinks in the web using the famous power method. Based on empirical distributions of Web page degrees, we derived analytically the probability distribution for the PageRank metric. We found out that it follows the familiar inverse polynomial law reported for Web page degrees.

Info:

Periodical:

Edited by:

Yuhang Yang, Xilong Qu, Yiping Luo and Aimin Yang

Pages:

747-751

DOI:

10.4028/www.scientific.net/AMR.216.747

Citation:

Y. L. He "A Novel Heuristic PageRank Algorithm in Web Search", Advanced Materials Research, Vol. 216, pp. 747-751, 2011

Online since:

March 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.