2008 International Symposiums on Information Processing
Improvement of Page Ranking Algorithm Based on Timestamp and Link
May 23-May 25
ISBN: 978-0-7695-3151-9
The traditional ranking algorithm favors the old pages, which makes old pages always appear on the top of the ranking results when pages are ranked according to the dynamic web by the static ranking algorithm. Therefore, this paper introduces temporal-link-analysis algorithm to resolve the problem. This algorithm uses the last modification time that returned by the HTTP response as the timestamp of nodes and links concerned. And the weight of the in-link and out-link are also integrated to compute the overall weight of the pages. Using the WTPR algorithm can make the old pages decline and new pages raise in the ranking result, meanwhile it can help the old pages which have high-quality get higher rank value than common old pages.
Citation:
Shiguang Ju, Zheng Wang, Xia Lv, "Improvement of Page Ranking Algorithm Based on Timestamp and Link," isip, pp.36-40, 2008 International Symposiums on Information Processing, 2008