Essay On Page Rank Algorithm

1605 Words4 Pages

2.1 Introduction This chapter discusses Page Rank Algorithm essential ideas and analyzes its computational formula and then mentions some problems related to the algorithm. With the rapid development of world –wide web, the users face the problem of retrieving useful information from the large number of disordered and scattered information. However, current search engines cannot fully satisfy the user’s need of high-quality information search services but the most classic web structure mining algorithm is Page Rank Algorithm. The Page Rank algorithm is based on the concepts that if a page contains important links towards it then the links of this page towards the other page are also to be considered as important pages. Page Rank algorithm calculates the importance of web pages using the link structure of the web pages. This approach explores the idea of simply counting in-links equally, by normalizing the number of links on a page when distributing rank scores. Therefore, Page Rank (i.e. a numeric value that represents how important a page is on the web) takes the back links into account and propagates the ranking through links: a page has a high rank if the sum of the ranks of its back links (in links) is high. It (Page Rank Algorithm) is one of the methods that Google (famous search engine) uses to determine the importance or relevance of a web page. 2.2 Problem When we had calculated the rank of a web page we came across with the concept that the total number of the back links of the webpage formed the rank of the page without giving weightage to the content of the content of the back linked web pages. Here all back links are considered equal, due to which the web pages containing less relevant information are treated as ... ... middle of paper ... ...Page Rank Algorithm in terms of returning larger numbers of relevant pages to a given query. As suggested, the performance of WPR is to be tested by using different websites and future work include to calculate the rank score by utilizing more than one level of reference page list and increasing the number of human user to classify the web pages. Furthermore, Weighted Page Rank Algorithm (WPR) consists of some limitations also, which are given as follows:- 1. It relies mainly on the in links and out links. 2. There is a less conclusion of the relevancy of the pages to a given query. 3. Weighted Page Rank (WPR) algorithm provides important formation about a given query by using the structure of the web. While some web pages may be irrelevant to a given query, it still receives the highest (topmost) rank because it has many in links (back links) and many out links.

Open Document