Work place: Department of Computer Science, Institute of Science, Banaras Hindu University, Varanasi -221005, India

E-mail: mishra@bhu.ac.in

Website:

Research Interests: Computational Science and Engineering, Computer systems and computational processes, Computer Architecture and Organization, Distributed Computing, Parallel Computing, Data Mining, Data Structures and Algorithms

Biography

**P. K. Mishra**is a Professor, in Department of Computer Science, Banaras Hindu University, India. He is also a Principal Investigator of the research projects at DST Centre for Interdisciplinary Mathematical Sciences, Banaras Hindu University. His research interests include Parallel and Distributed Computation, Computational Complexity, Parallel and Clustered Data Mining, High Performance Computing and VLSI Algorithms. Prof. Mishra has more than 70 publications in conference proceedings and journals. He is a reviewer and editor of various journals and senior member of IEEE.

By Atul Kumar Srivastava Rakhi Garg P. K. Mishra

DOI: https://doi.org/10.5815/ijisa.2017.09.03, Pub. Date: 9 Sep. 2017

Web search engines use various ranking methods to determine the order of web pages displayed on the Search Engine Result Page (SERP). PageRank is one of the popular and widely used ranking method. PageRank of any web page can be defined as a fraction of time a random web surfer spends on that web page on average. The PageRank method is a stationary distribution of a stochastic method whose states are web pages of the Web graph. This stochastic method is acquired by combining the hyperlink matrix of the web graph and a trivial uniform process. This combination is needed to make primitive so that stationary distribution is well defined. The combination depends on the value of damping factor α∈[0,1] in the computation of PageRank. The damping factor parameter state that how much time random web surfer follow hyperlink structure than teleporting. The value of α is exceptionally empirical and in current scenario α = 0.85 is considered as suggested by Brin and Page. If we take α =0.8 then we can say that out of total time, 80% of time is taken by the random web surfer to follow the hyperlink structure and 20% time they teleport to new web pages randomly. Today web surfer gets worn out too early on the web because of non-availability of relevant information and they can easily teleport to new web pages rather than following hyperlink structure. So we have to choose some value of damping factor other than 0.85. In this paper, we have given an experimental analysis of PageRank computation for different value of the damping factor. We have observed that for value of α=0.7, PageRank method takes fewer numbers of iterations to converge than α=0.85, and for these values of α the top 25 web pages returned by PageRank method in the SERP are almost same, only some of them exchange their positions. From the experimental results it is observed that value of damping factor α=0.7 takes approximate 25-30% fewer numbers of iterations than α=0.85 to get closely identical web pages in top 25 result pages for personalized web search, selective crawling, intra-web search engine.

[...] Read more.Subscribe to receive issue release notifications and newsletters from MECS Press journals