Abstract
PageRank is an algorithm that brings an order to the Internet by returning the best result to the users corresponding to a search query. The algorithm returns the result by calculating the outgoing links that a webpage has thus reflecting whether the webpage is relevant or not. However, there are still problems existing which relate to the time needed to calculate the page rank of all the webpages. The turnaround time is long as the webpages in the Internet are a lot and keep increasing. Secondly, the results returned by the algorithm are biased towards mainly old webpages resulting in newly created webpages having lower page rankings compared to old webpages even though new pages might have comparatively more relevant information. To overcome these setbacks, this research proposes an alternative hybrid algorithm based on an optimized normalization technique and content-based approach. The proposed algorithm reduces the number of iterations required to calculate the page rank hence improving efficiency by calculating the mean of all page rank values and normalising the page rank value through the use of the mean. This is complemented by calculating the valid links of web pages based on the validity of the links rather than the conventional popularity.
Highlights
The aim of this paper is to address the above issues by proposing an enhanced PageRank algorithm that combines optimized normalized technique (3) and content-based approach (4)
Error! Reference source not found. shows the iterations needed for the proposed PageRank algorithm to calculate the final true page ranks of all webpages
The proposed algorithm reduces the number of iterations required to calculate the page rank, improves the efficiency, by calculating the mean of all page rank values and normalizes them through the use of the mean
Summary
Error! Reference source not found. shows the iterations needed for the proposed PageRank algorithm to calculate the final true page ranks of all webpages. Shows the iterations needed for the proposed PageRank algorithm to calculate the final true page ranks of all webpages. The proposed algorithm requires only 27 iterations to calculate the final true page ranks of all webpages. This research is aim to propose an enhanced algorithm to get the result without favoring to old webpage. This objective is test by ranking position of PageRank algorithm and the ranking position obtained by using the proposed algorithm will be compare with the ranking position with the PageRank algorithm. In additon the an enhanced algorithm will decrease the iteration needed to calculate the page rank. This objective is test by the number of iterations needed to calculate the final page rank of all the webpages
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
