Role of Page ranking algorithm in Searching the Web: A Survey

Transcription

1 Role of Page ranking algorithm in Searching the Web: A Survey Amar Singh Bhagwant institute of technology, Muzzafarnagar Sanjeev Sharma Krishna Institute of Eengineering& Technology, Ghaziabad, India Abstract: Web mining is awidely used research area today. Web pages that exist today, search engines assume an important role inthe current Internet.Finding relevant pages for any search topic, the number of results returned is often too big to be carefully explored. An application of Web mining can be seen in the case of search engines.search engines typically linked to pages contains highest keyword value, which meant people could game the system by repeating the same phrase over and over to attract higher search page results. Most of the search engines are ranking their search results in response to users' queries to make their search navigation easier. The role of ranking algorithms is thus crucial: select the pages that are most likely be able to satisfy the user s needs, and bring them in the top positions. In this paper, a survey of page ranking algorithms is discussed; we will cover the most popular algorithms usedtoday by the search engines: PageRank, N-stepPageRank, Weighted PageRank Algorithm, HITS etc. Keywords: PageRank, HITS, Search Engine. 1. INTRODUCTION A billions of web pages and huge amount of information available within pages over WWW [4]. Search engines perform number of task based on their respective architecture are used to retrieve this information. Search engine process goes from Crawling, Indexing, Searching, and Sorting/Ranking of information [4][5][6]. The most important process of search engine is indexing in order to decrease the time needed to retrieval. Index is generally maintained alphabetically considering the keywords. When a user fires a query in form of keywords on the interface of a search engine, it is retrieved by the query processor component, which after matching the query keywords with the index returns the URLs of the pages to the user. But before 39 Amar,Sanjeev representing the pages to the user, some ranking mechanism is used by most of the search engines to make the user search navigation easier between the search results [4][7][8].Search engine uses ranking algorithm in order to sort the results to be displayed. That way user will have the most important and useful result first. There are various ranking algorithms developed, few of them are PageRank. [10]All of the proposed ranking methodsproposed till date either consider the content-orientedapproaches (web content mining) or the link-orientedapproaches (web structure mining) of Web Mining [7]. The method ranks a web page based on thevisits that a user performs on its inbound links. Thus a pagewhich is considered to full fill users information needs isprovided with more relevance ranking. The paper is structured as follows: in section 2 literature survey is discussed. Section 3describes some relevant page rank algorithms In Section 4, concludes the paper. 2. LITERATURE SURVEY The AltaVista Search Engine implements HITS algorithm [15], The AltaVista Search Engine implements HITS algorithm [16]. But the HITS (Hyperlink Induced Topic Search) is a purely link structure-based computation, ignoring the textual content [17][18]. In [19] the links of a web page are weighted based on the number of in-links and out-links of their reference pages. The resulting algorithm is named as weighted page rank. These two page ranking algorithms [18] [19] [20] does not take any extra information from the surfer for giving an accurate ranking. In [17] a new approach of dissecting queries into crisp and fuzzy part has been introduced. The user interface is proposed to be divided into two phase. The first phase will take crisp queries whereas the second phase consider the fuzzy part (like the words popular, moderate distance etc.) of the query.

2 Efforts are also been taken to make the ranking more accurate by incorporating topic preference of user during ranking. In [19], a parameter viz. sensitiveness is measured which provides the relevance of a doc with respect to a term [20]. The scope of search engine is divided into global and local scope. The local scope is developed from inverse document table and used to measure the query sensitiveness of a page. The pages are ranked based on two parameters-their global importance and query sensitiveness. In spite of all sophistication of the existing search engine, sometimes they do not give satisfactory result [20] [19][18]. The reason is that most of the time a surfer wants a particular type of page like an index page to get the links to good web pages or an article to know details about a topic. For example if a search topic like "Human Computer Interaction" is given, it is easy to guess that education related pages are wanted; there is no need of using any extra knowledge to derive the user's demand for the proper class of pages. 3. PAGE RANK ALGORITHMS Rank of pages works by counting numbers and quality of links to a page to determine, how important the website is. PageRank algorithms are a link analysismethod and it assigns a numerical weighting to every element of a hyperlinkedset of a web page. A PageRank results from a mathematical algorithm based on the webgraph, created by all World Wide Web pages as nodes and hyperlinks as edges [1][2][3]. It is important to understand and analysefor efficient Information Retrieval that the underlying data structureof the Web. Web mining techniques along with other areaslike Database (DB), Natural Language Processing (NLP), Information Retrieval (IR), MachineLearning etc [3] [4]. can be used to solve the challenges. Search engines like Google, Yahoo, Iwon,Web Crawler, Bing etc., are used to find information from the World Wide Web (WWW) by the users [1]. Therefore, it is necessary to be more efficient in its processing way and output by the search engine. Web mining techniques are employed to extract relevant documents from the web database documents by 40 Amar,Sanjeev the search engines. The search engines become very successful and popular if they use efficient ranking mechanisms. If the search results are not displayed according to the user interest then the search engine will lose its popularity, so the ranking algorithms become very important. Some of the popular page ranking algorithms or approaches are discussed below [1].Web users are most interested in relevant and authoritative pages that are trustedsources of correct information that have a strong presence on the web. Thus, in web search the focusshifts from relevance to authoritativeness [2]. The ranking function s task is to identify and rank highly the authoritative documents within a collection of web pages [2] The intuition underlying the In-Degree algorithm is that a good authority is a page pointed to by many other pages [3] PageRank is an attempt to see how good an approximation of importance can be obtained just from the link structure.[2] PageRank simulates a random walk on the web graph (nodes in the graph represent web pages, and edges represent hyperlinks), and uses the stationary probability of visiting each webpage to represent the importance of that page [4].Therefore, the search engines needs tobe more efficient in its way of output. Simple PageRank Algorithm A ranking algorithm is developed [4] [5] [6] by Google called PageRank that uses the link structure to determine the importance of web pages. To order its search results Google [7] uses PageRank, so that sites/documents that are deemed more "important" move up in the results of asearch accordingly. This algorithm states that if a pagehas some important incoming links to it then itsoutgoing links to other pages also become important[7].therefore, it takes backlinks into account andpropagates the ranking through links. Thus, a page hasa high rank if the sum of the ranks of its backlinks ishigh.the PageRank algorithm assigns a PageRankscore to more than 25 billion web pages [7] on thewww. During the processing of a query, for each web page

3 Google ssearch algorithm mix pre-computed PageRankscores with text matching scores [11] to obtain anoverall ranking score. Weighted PageRank Algorithm An extension to simple PageRank of google is propose [4] [9] [10] and called Weighted PageRank (WPR). It states that more popular the web pages, more linkages other web pages tend to have to them or are linked to by them. WPR assigns a larger rank values to more important pages instead of dividing the rank value of a page evenly among its outgoing linked pages. Each outlink page gets a value proportional to its popularity[7][8] [9]. The popularity is measured by its number of in-links and out-links. The popularity from the number of in-links and outlinks is recorded in the weight of link(v, u) and calculated based on the number of in-links of page u and the number of in-links of all reference pages of page v. HITS Hyperlink-Induced Topic Search (HITS)[8, 9, 13, 14] is based on WSM algorithm. It assumes that for each query topic, there are someauthority pages or links that are relevant and popular focusing on the topic and there are "hub" pages/sites that contain useful links to relevant sites including links to many related authorities (Fig 1). The HITS algorithm has two major steps: 1. Sampling step: It collects a set of relevantweb pages for a given topic. 2. Iterative step: It finds hubs and authoritiesusing the information collected duringsampling.confers some authority on page q.there are lots of problems with HITS algorithms Hubs and authorities: clear-cut distinction between hubs and authorities may not be appropriate since many sites are hubs as wellas authorities; Topic drift- Certain arrangements of tightly connected documents, perhaps due to mutually reinforcing relationships between hosts, can dominate the HITS computation [9] [11] [13] [14]. These documents in some instances may not be the most relevant to the query that was posed; Automatically generated link- Some of the links are computer generated (for example, every page in my School has a link to the School homepage and to the copyright page)and represent no human judgment but HITS still gives them equal importance; Non-relevant documents- Some queries can return non-relevant documents in the highly ranked queries and this can then lead to erroneous results from the HITS algorithm. The problem is more common than it might appear; Efficiency- The real-time performance of the algorithm is not good given the steps that involve finding sites that are pointed to by pages in the root pages [10] [12] [9]. N-step PageRank When the surfer chooses the next webpage in simple PageRank algorithm, the information of direct out-links of the current pagechooses one of the out-link pages with equal probability. Outlinks can actually be distinguished from many facts. The surfer may find more useful information or more hyperlinks to new pages after clicking one out-links than the other [8] [9]. Inspired by the look N-step ahead strategy in a computer chess, we propose using the information contained in the next N-step surfing to represent the informationcapacity of an out-link, and thus distinguish different out-links [9]. Visits of Links Based PageRank We have seen that original PageRank algorithm, the rank score of a page, p, is divided among its outgoing links, an inbound links brings rank value 41 Amar,Sanjeev

4 from base page, p( rank value of page p divided by number of links on that page) [4][5][6]. By assigning more rank value to the outgoing links which is most visited by users. In this manner a page rank value is calculate based on visits of inbound links. The extended Rank value based on VOL is given in equation [4] PR(u)= (1-d)+d L u (PR(v))/TL(v) vɛb(u) Notations are: Lu denotes number of visits of link which is pointing page u from v. TL(v) denotes total number of visits of all links present on v. Other notations are same as in original PageRank equation [4] [5] [9]. Advantages of link visit based algorithm are as;vol method uses link structure of pages and their browsing information, the top returned pages in the result list are supposed to be highly relevant to the user information needs [4]. A link with high probability of visit contributes more towards the rank of its out linked pages; The rank value of any page by PageRank method will be same either it is seen by user or not, because it is totally dependent upon link structure of Web graph. While the ordering of pages using VOL is more targetoriented;a user can not intentionally increase the rank of a page by visiting the page multiple times because the rank of the page depends on the probability of visits (not on the count of visits) on back linked pages [4]. The main issue to address is the periodic crawling of web servers so as to collect the accurate and up to date visit count of pages [1][2][3][4]. Specialized crawlers need to be designed for fetching the required information of pages 4. CONCLUSION & FUTURE WORK On the basis of this survey we conclude that Page Rank is a more popular algorithm used as the basis for the very popular Google search engine. This popularity is due to the features like efficiency, feasibility, less query time cost, less susceptibility to localized links etc. which are absent in HITS algorithm. Algorithm based on link visited calculates page rank value or importance of web pages based on the visits of incoming links on a page. It is not only consider link structure it includes the users focus on a particular page. But the main problem in this concept is calculation of visits of a links, for that we have given a simple concept to monitor and count the hits or visits However though the HITS algorithm itself has not been very popular, different extensions of the same have been employed in a number of different web sites. As a future guidance, such algorithmsshould be developed that can consider the relevancy aswell as importance of a page so that the quality ofsearch results can be improved. 5. REFRENCES [1] Role of Ranking Algorithms for Information Retrieval Laxmi Choudhary1 and Bhawani Shankar Burdak, Banasthali University, Jaipur, Rajasthan laxmi.choudhary23@gmail.com2 BIET, Sikar, Rajasthanbhawanichoudhary92@gmail.com [2] A Survey of Ranking Algorithms AlessioSignorini Department of Computer Science University of Iowa. [3] S.Brin, L.Page, The anatomy of a large-scale hypertextual web search engine, Proceedings of the 7th International World Wide web Conference, N-Step PageRank for Web Search Li Zhang1, Tao Qin2, Tie-Yan Liu3, Ying Bao4, Hang Li3 [4] Page Ranking Based on Number of Visits of Links of Web Page,Gyanendra Kumar, NeelamDuhan, A. K. Sharma, Department of Computer Engineering, YMCA University of Science & Technology, Faridabad, India. [5] S. Brin and L. Page.The Anatomy of a Large- Scale Hyper textual Web Search Engine. In 42 Amar,Sanjeev

5 Proceedings of the 7th International World Wide Web Conference, pages , [6] Wenpu Xing, Ali Ghorbani. Weighted PageRank Algorithm[C], Proceedings of the Second Annual Con - ference on Communication Networks and Services R - esearch, IEEE, [7] Kleinberg, J., Authorative Sources in a Hyperlinked Environment. Proceedings of the 23rd annual International ACM SIGIR Conference on Research and Development in Information Retrieval, [8] Amy N. Langville and Carl D. Meyer, Deeper Inside PageRank, October 20, [9] Page Ranking Algorithms: A Survey NeelamDuhan, A. K. Sharma, Komal Kumar Bhatia, Advance Computing Conference, IACC 2009.IEEE International. [10] NareshBarsagade, Web Usage Mining and Pattern Discovery: A Survey Paper, CSE 8331, Dec.8,2003. [11] JaroslavPokorny, JozefSmizansky, Page Content Rank: An Approach to the Web Content Mining. [12] Wenpu Xing and Ali Ghorbani, Weighted PageRank Algorithm, Proceedings of the Second Annual Conference on Communication Networks and Services Research (CNSR 04), 2004 IEEE [13] Saeko Nomura, Satoshi Oyama, Tetsuo Hayamizu, Analysis and Improvement of HITS Algorithm for DetectingWeb Communities. [14] Longzhuang Li, Yi Shang, and Wei Zhang, Improvement of HITS-based Algorithms on Web Documents, WWW2002, May 7-11, 2002, Honolulu, Hawaii, USA. ACM /02/0005. [15] A Syntactic Classification based Web Page Ranking Algorithm DebajyotiMukhopadhyay, PradiptaBiswas, Young-Chon Kim, 6th International Workshop on MSPT Proceedings MSPT [16] Alta Vista Search Engine; [17] Kleinberg, Jon; Authoritative Sources in a Hyperlinked Environment; Proc. ACM-SIAM Symposium on Discrete Algorithms, 1998; pp [18] Madria, Sanjay Kumar; Web Mining: A Bird s Eye View; WISE 2002, Singapore. [19] Baeza-Yates,Ricardo; Davis, Emilio; Web page ranking using link attributes, Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, May 2004 [20] Xing, W.; Ghorbani, A.; Weighted PageRank algorithm; Proceedings of the Second Annual Conference on Communication Networks and Services Research, May 2004; pp [21] Dae-Young Choi ; Enhancing the power of Web search engines by means of fuzzy query Decision Support Systems, Volume 35, Issue 1, April 2003, pp Amar,Sanjeev