Web Page Ranking Algorithm Based on the Meta-Information

Article Preview

Abstract:

PageRank algorithms only consider hyperlink information, without other page information such as page hits frequency, page update time and web page category. Therefore, the algorithms rank a lot of advertising pages and old pages pretty high and can’t meet the users' needs. This paper further studies the page meta-information such as category, page hits frequency and page update time. The Web page with high hits frequency and with smaller age should get a high rank, while the above two factors are more or less dependent on page category. Experimental results show that the algorithm has good results.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

292-296

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] T.H. Haveliwala, Topic-sensitive PageRank, in: Proceedings of the 11th International World Wide Web Conference, (2002).

DOI: 10.1145/511446.511513

Google Scholar

[2] T.H. Haveliwala, S.D. Kamvar, The second eigenvalue of the Google matrix, Stanford University Technical Report, (2003).

Google Scholar

[3] J. Hirai, S. Raghavan, H. Garcia-Molina, A. Paepcke, WebBase: a repository of web pages, in: Proceedings of the Ninth International World Wide Web Conference, (2000).

DOI: 10.1016/s1389-1286(00)00063-3

Google Scholar

[4] G. Jeh, J. Widom, Scaling personalized web search, in: Proceedings of the 12th International World Wide Web Conference, (2003).

DOI: 10.1145/775152.775191

Google Scholar

[5] S.D. Kamvar, T.H. Haveliwala, C.D. Manning, G.H. Golub, Extrapolation methods for accelerating PageRank computations, in: Proceedings of the 12th International World Wide Web Conference, (2003).

DOI: 10.1145/775152.775190

Google Scholar

[6] L. Page, S. Brin, R. Motwani, T. Winograd, The PageRank citation ranking: bringing order to the web, Stanford Digital Libraries Working Paper, (1998).

Google Scholar