International Journal of Computer Applications (0975 – 8887) Volume 99– No.1, August 2014 35 Artificial Bee Colony (ABC) Approach for Ranking Web Pages G.Anuradha Research Scholar Dept. of CS&SE Andhra University Visakhapatnam Andhra Pradesh, India G. Lavanya Devi, Ph.D Assistant Professor Dept. of CS&SE Andhra University Visakhapatnam Andhra Pradesh, India ABSTRACT The World Wide Web (WWW) is rapidly growing on all aspects and is a massive, explosive, data resource in the world. In information retrieval approach web Search engines are predominant tools for finding and getting access to the contents of web. The primary goal of Search engine is to provide relevant information to the users according to their needs, Usually Search engines gives large result set for a user’s query. To limit the result list, it is necessary to assign ranking the web pages in an efficient and effective manner. Artificial Bee Colony (ABC) is one of the new approaches used to solve optimization problems. This paper proposes Artificial Bee Colony (ABC) approach as a new method for web mining particularly in ranking web pages. It considers users interest, total web site linkage and growth analysis rate are used to assign rank the web pages. Proposed ABC approach for ranking web pages is implemented and tested on real datasets. The experimental results shows efficiency of the proposed method compared with tradition page Rank Algorithm. Keywords WWW, Search engine, Artificial Bee Colony (ABC), User interest, Total web site linkage, growth analysis rate 1. INTRODUCTION The exponential growth of the data on www is a challenge to Search Engines. User needs to use information retrieval tools for desired information. Search engine is a tool used to find required information from the World Wide Web. The architecture of search engine is shown in fig1, it consists of three major components: Crawler, Indexer and Ranking mechanism[1].Crawler traverses the web and collects web pages from the web. Collected web pages are sent to index module. Indexer creates and maintains the index. When user poses a query in the interface of the search engine, query processor component match is the query keywords with the index and returns the URLs of the pages to the user. Ranking mechanism is applied before showing results to the user. Page ranking was first introduced to rank the importance of web pages on the web. It is a fundamental requirement of search engines to make the search results up-to-date and very fast[2]. In any information retrieval system ranking plays a main Role. Most of the Search engines return million of pages for a given query, It is highly impossible for a user to preview all the returned results, ranking is helpful in web searching.Based on content and connectivity, ranking is divided into two categories.Content based ranking is depends on content of web page,Connectivity ranking based on link analysis technique. There are two famous link analysis methods [3]:- i)Page Rank Algorithm and ii) HITS Algorithm. Fig1: Basic search engine Architecture