-
Essay / Page Ranking Algorithm Essay - 1605
2.1 IntroductionThis chapter discusses the essential ideas of the page ranking algorithm and analyzes its calculation formula, then mentions some problems related to the algorithm. With the rapid development of the Web, users face the problem of retrieving useful information from a large number of messy and scattered information. However, current search engines cannot fully satisfy users' needs for high-quality information search services, but the most classic web structure mining algorithm is the page ranking algorithm . The Page Rank algorithm is based on the concept that if a page has important links to it, then the links from that page to the other page should also be considered important pages. The Page Rank algorithm calculates the importance of web pages using the link structure of web pages. This approach explores the idea of simply counting inbound links equally, normalizing the number of links on a page when distributing ranking scores. Thus, the Page Rank (i.e. a numerical value which represents the importance of a page on the web) takes into account the backlinks and propagates the ranking through the links: a page has a high rank if the sum of the ranks of its back links (in the 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 ProblemWhen we have calculated the rank of a web page, we are stumbled upon the concept that the total number of backlinks of the webpage formed the page ranking without giving weight to the content of the backlinked webpages. Here all backlinks are considered equal, which is why web pages with less relevant information are treated as...... middle of paper...... Page ranking algorithm in terms of returning a greater number of pages relevant to a given query. As suggested, the performance of WPR should be tested using different websites and future work includes calculating the ranking score using more than one level of reference page list and increasing the number of human users to rank web pages. Additionally, the Weighted Page Ranking (WPR) algorithm also includes some limitations, which are given as follows: -1. It mainly relies on inbound and outbound links.2. There is less conclusion about the relevance of pages for a given query.3. The Weighted Page Rank (WPR) algorithm provides significant training on a given query using the structure of the web. Although some web pages may not be relevant to a given query, they still receive the highest (highest) ranking because they contain many inbound links (backlinks) and many outbound links..