Essay On Link Analysis

III. LINK ANALYSIS ALGORITHMS

In the development of web search Link analysis the analysis of hyperlinks and the graph structure of the Web have been helpful which is one of the factors considered by web search engines in computing a composite rank for a web page on any given user query. The directed graph configuration is known as web graph. There are several algorithms based on link analysis. The important algorithms are Hypertext Induced Topic Search (HITS), Page Rank, Weighted Page Rank, and Weighted Page Content Rank.
A. HITS Algorithm
HITS stands for Hypertext Induced Topic Search. It is a link based algorithm which is used to rank pages that are retrieved from the web according to the given user query based on their textual information. When the user retrieved the required pages then HITS algorithm started ignoring textual information and starts focusing on the structure of web only.

In [13], the algorithm is used to rank the relevant pages and treat all the links equally for the distribution of rank scores. In this, HITS rank the pages by analysing their in-links and out-links. The web pages that points to the hyperlinks are known as hubs but the hyperlinks that points to the web pages are known as authorities. Let ap and hp represent the authority and hub scores of page p, respectively. B (p) and I (p) denote the set of referrer and reference pages of page p, respectively. The scores of hubs and authorities are calculated as follows:

In [14], HITS provides the root set by taking top n pages then incorporates the root set with the webpages linked to it and webpages linked from it to form the base set. The webpages and links included in the base set are used to form sub graph. In this paper, they...

... middle of paper ...

... is the weight of link(v, u) calculated based on the number of out links of page u and the number of out links of all reference pages of page v [14].

where Ou and Op represent the number of out links of page u and page p, respectively. R(v) denotes the reference page list of page v. To calculate the rank in WPR algorithm:

In [13], the proposed system represents the evaluation of weighted page algorithm in which the work carried out as:
• In this, website with number of hyperlinks is necessarily founded because this algorithm relies on web structure.
• After this 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.
• The pages are directly point to or are pointed to by the pages in the root set creates a base set.