A Novel Heuristic PageRank Algorithm in Web Search

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

747-751

Citation:

Online since:

March 2011

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] D. Dhyani, S.S. Bhowmick, W.K. Ng, Deriving and verifying statistical distribution of a hyperlinked-based Web page quality metric, in: Proceedings of the 13th International Conference on Databases and Expert Systems Applications (DEXA 2002), France, (2002).

DOI: 10.1007/3-540-46146-9_3

Google Scholar

[2] R. Lempel, S. Moran, The stochastic approach for link structure analysis (SALSA) and the TKC effect, in: Proceedings of the Ninth World Wide Web Conference, (2000).

DOI: 10.1016/s1389-1286(00)00034-7

Google Scholar

[3] R. Lempel, A. Soffer, PicASHOW: pictorial authority search by hyperlinks on the Web, in: Proceedings of the Tenth International World Wide Web Conference, Hong Kong, (2001).

DOI: 10.1145/371920.372098

Google Scholar

[4] R. Fagin, R. Kumar, and D. Sivakumar, Comparing Top k Lists, Proc. ACM-SIAM Symp. Discrete Algorithms, (2003).

Google Scholar

[5] L. Finkelstein, E. Gabrilovich, Y. Matias, E. Rivlin, Z. Solan, G. Wolfman, and E. Ruppin, Placing Search in Context: The Concept Revisited, " Proc. 10th Int, l World Wide Web Conf., (2001).

DOI: 10.1145/371920.372094

Google Scholar