blog




  • Essay / Essay on Link Analysis - 1261

    III. LINK ANALYSIS ALGORITHMS In the development of web search, link analysis, analysis of hyperlinks and graphic structure of the web have been useful, which is one of the factors considered by web search engines in calculating a composite ranking for a web page on a given user query. The directed graph configuration is known as web graph. There are several algorithms based on link analysis. Important algorithms are Hypertext-Induced Topic Search (HITS), Page Ranking, Weighted Page Ranking, and Weighted Page Content Ranking.A. HITS AlgorithmHITS stands for Hypertext Induced Topic Search. It is a link-based algorithm that is used to rank pages retrieved from the web based on the given query of the user based on their textual information. When the user retrieved the required pages, the HITS algorithm started ignoring textual information and focusing only on the web structure. In [13], the algorithm is used to rank relevant pages and treat all links equally for ranking score distribution. . In this, HITS ranks pages by analyzing their inbound and outbound links. Web pages that point to hyperlinks are called hubs, but hyperlinks that point to web pages are called authorities. Let ap and hp represent the authority and hub scores of page p, respectively. B (p) and I (p) respectively designate the set of reference and reference pages of page p. The scores of hubs and authorities are calculated as follows: In [14], HITS provides the root set by taking the first n pages, then embeds the root set with web pages linked to it and web pages linked to from this to form the basic set. Web pages and links included in the base set are used to form a subgraph. In this article they...... in the middle of the article...... is the link weight (v, u) calculated based on the number of outgoing links of the page u and the number of links outgoing links from any page reference on page v [14]. where Ou and Op represent respectively the number of outgoing links from page u and page p. R(v) designates the list of reference pages of page v. To calculate the rank in the WPR algorithm: In [13], the proposed system represents the evaluation of the weighted page algorithm in which the work performed as:• In this website with The number of hyperlinks is necessarily founded because this algorithm is based on the structure of the Web. • After that, a required web map is generated for the selected website. • Then a set of relevant pages with the given user query is retrieved using the search engine. The relevant set of pages is called the root set. • Pages point directly to or are pointed to by pages in the root set creates a base set..