RatioRank: Enhancing the Impact of Inlinks and Outlinks Ranveer Singh Department of CEA G.L.A. University Mathura, India ranveersingh@ieee.org Dilip Kumar Sharma Department of CEA GLA University Mathura, India drdilipsharma@ieee.org Abstract—As web is the largest collection of information and plenty of pages or documents are newly added and deleted on frequent basis due to the dynamic nature of the web. The information present on the web is of great need, the world is full of questions and the web is serving as the major source of gaining information about specific query made by the user. As per the search engine for the query, a number of pages are retrieved among which the quality of the page that are retrieved is questioned. On the retrieved pages the search engine apply certain algorithms to bring an order to the pages retrieved so that the most relevant document or pages are displayed at the top of list. In this paper a new page ranking algorithm known as the RatioRank is discussed, in which the inlink weights and outlink weights are used with the consideration of number of visit count and is compared with some algorithms by using certain parameters. Keywords-Inlinks, outlinks, Page Ranking, Inbound links, outbound links,Visit count, Information Retrieval, World Wide Web. I. INTRODUCTION WWW is the largest collection of the data and is expanding or changing every minute .The WWW consists of the large hyperlinked structure or the unstructured hyperlinked content. Page Ranking algorithm uses the linked structure of the retrieved web pages to determine the rank of the web pages in terms of the inlinks, outlinks and the number of times visit of links. Mathematical algorithms are being used to rank the webpages on the basis of the webgraph, which is being created by all WWW pages as nodes and hyperlinks as the edges between the pages. Hyperlink votes for the computation of the importance of the page and the rank value indicates the importance of that page. The goal of the page ranking is to make the user get the desired result at the top of the list and the paper presents the limitations and strength of link based algorithms and a new page ranking algorithm is proposed such that it can satisfies the user needs. The paper is arranged as follows, section II presents the related work on various linked based page ranking algorithms as “The Page Ranking Algorithm”(by Google)[1], “HITS”(Hypertext Induced Topic Search)[3], “Weighted Page Ranking Algorithm” [5], “Page Ranking Based on Number of Visit of Links Of Webpage”[7], “Weighted Page Ranking Based on Visit of Links” [6], “Normalization Page Ranking Algorithm “[8], section III of the paper summarizes the discussed page ranking algorithms with the strengths and limitations, section IV explains the Proposed Algorithm: RatioRank, in which the inlinks, outlinks weight and the number of times user visit the link of the page, hence if a page having important links to it is considered for ranking and also the pages linked by that page are also considered for computation. Section V will give the comparison of different page ranking algorithms, section VI describes the benefits and limitations of the RatioRank algorithm and section VII concludes the paper and gives the future work of the proposed algorithm. II. RELATED WORK A. PAGE RANKING ALGORITHM Page Ranking Algorithm [1] is the most widely used algorithm, developed by S.Brin and L. Page (co-founder of the Google).Web consists of the rich hyperlinked structure and the Page Ranking Algorithm utilizes that structure to rank the web pages. According to the Page Ranking Algorithm, if any webpage have many popular inlinks to it then the page is also important means the Page Ranking Algorithm ranks the webpages using the inlinks to it. The importance of a webpage is higher than other page if the sum of inlinks to that webpage is higher than other webpage. 794 978-1-4673-4529-3/12/$31.00 c 2012 IEEE