EFFECTIVELY FINDING THE RELEVANT WEB PAGES FROM THE WORLD WEB WIDE Dr.N.P.Gopalan Mrs. J. Akilandeswari P. Gabriel Sagaya Selvam HOD I/C, Asst.Prof/Dept of CSE Asst. Prof/Dept of CSE II yr M.E (CSE) National Institute of Technology Sona College of Technology Sona College of Technology Trichy - 620015 Salem – 636005. Salem – 636005. ABSTRACT: Effective & efficient retrieval of the required quality web pages on the web is becoming a greater challenge. Early work on search engines concentrated on the textual content of web pages to find relevant pages, but in recent years, the analysis of information encoded in hyperlinks has been used to improve search engine performance. For these reasons, this paper presents three hyperlink analysis-based algorithms to find relevant pages for a given web page (URL). The first algorithm comes from the extended co citation analysis of the web pages. The second one takes advantage of linear algebra theories to reveal deeper relationships among the web pages and to identify relevant pages more precisely and effectively. The third one presents a variation on the use of linkage analysis for automatically categorizing web pages, by defining a similarity measure. This measure is used to categorize hyperlinks themselves, rather than web pages. Also this paper presents a moved Page Algorithm to detect and eliminate the dead pages. Key-words: Hyperlink analysis, Singular Valued Decomposition, Page Source, Relevant, Moved Pages, Similar search 1. INTRODUCTION 1.1 Background for the study By definition, Relevancy is the one that addresses same topic as original page, but is not necessarily semantically identical one. Hyperlink has its own advantages where it encodes a considerable amount of latent human judgment in most cases. The creators of web pages create links to other pages, usually with an idea in mind that the linked pages are relevant to the linking pages. Therefore, a hyperlink, if it is reasonable, reflects the human semantic judgment and judgment is objective and independent of synonymy, polysemy of the words in the pages. When hyperlink analysis is applied to the relevant page finding, its success depends on how to solve the following two problems: 1) How to construct a page source that is related to the given page. 2) How to establish the effective algorithms to find the relevant pages from a given constructed page source.