Research on PageRank Algorithm to Index Pages
PageRank algorithm is a vital method to determine the importance of pages. Useful as it is, the algorithm has many disadvantages. Therefore, we arrive at the conclusion that it’s not rational to calculate the importance degree of pages simply by links between them. Considering the timeliness problem of PageRank algorithm, we provide the time penalty factor W(n) to weigh the effects of update time on page ranking. After adding the time penalty factor to the original PageRank algorithm, we come up with the refined PageRank algorithm. Our algorithm is superior compared with the original one and many other existing methods that weigh the effects of update time. We judge update time by the times a page is crawled by Web crawlers. Consequently, drawbacks of the methods that use the real time to measure update time can be overcome and the order of pages can meet users’ need better.