Analysis of HITS Algorithm for Information Retrieval

As the use of web is increasing more day by day, the World Wide Web is rapidly growing on all aspects. It is the duty of service provider to provide relevant information to the internet user against their query submitted to the search engine. The WWW consists of pages that reference (link to) each other. Interesting pages are referenced by several other pages or interesting pages are referenced by interesting pages. If a page is referenced several interesting pages, it might be itself interesting. This paper present the analysis of one ranking algorithm (HITS algorithm) based on various parameters to find out their advantages and limitations for the ranking of the web pages