Research on PageRank Algorithm to Index Pages

He Ping Zhang; Ya Ping Zhao; Ya Li Zhao

doi:10.4028/www.scientific.net/AMM.198-199.1469

Paper Titles

Study of Airport Ground Services Scheduling Problem in Airline Industry
p.1447

Research on the Prediction of Drug Sales Based on Levenberg-Marquardt Algorithm
p.1452

The SQL Injection Vulnerability Detection of the Web Application
p.1457

Toeplitz Robust Noisy Speech Endpoint Detection
p.1462

Research on PageRank Algorithm to Index Pages
p.1469

A Novel Registration Algorithm for Pol-InSAR Images Based on the RVOG Model
p.1475

Three-Dimensional Mesh Model Watermarking Algorithm
p.1481

Parallel Programming Methods Based on the Multi-Core DSP TMS320C6670
p.1487

Blind Equalization Algorithm Based on the Orthogonal Wavelet Transform for SIMO Systems
p.1493

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 198-199Research on PageRank Algorithm to Index Pages

Research on PageRank Algorithm to Index Pages

Abstract:

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.