2019Unpublished venueRequires access

An Improved PageRank Algorithm Based on Reachability to Reduce Mutual Reinforcement Effect

Rinkal Sardhara, Kamaljit I. lakhataria

Open publisher page 5 citations

Abstract

It is very difficult to find relevant information in this rapidly growing hyper structure. Basically web site owner creates web site to provide relevant information to cater user's need. Therefore, it is very important to retrieve web pages based on user's interest and behavior by finding the content of the web page. Link analysis is the significant parameter to find related information. PageRank and HITS are two basic algorithms which works on web structure mining. Numerous algorithms have been developed to improve performance based on these two basic algorithms. An Improved PageRank Algorithm (IPRA), is the extension of the page Rank algorithm, is introduced in this paper. IPRA takes into account the number of different domain inlink and outlink and distributes the rank score based on the reachability of the web pages. The result of our model studies shows that IPRA algorithms give better result than the standard PageRank algorithm.

About this research paper

What this paper is about

It is very difficult to find relevant information in this rapidly growing hyper structure. Basically web site owner creates web site to provide relevant information to cater user's need. Therefore, it is very important to retrieve web pages based on user's interest and behavior by finding the content of the web page. Link analysis is the significant parameter to find related information. PageRank and HITS are two basic algorithms which works on web structure mining. Numerous algorithms have been developed to improve performance based on these two basic algorithms. An Improved PageRank Algorithm (IPRA), is the extension of the page Rank algorithm, is introduced in this paper. IPRA takes into account the number of different domain inlink and outlink and distributes the rank score based on the reachability of the web pages. The result of our model studies shows that IPRA algorithms give better result than the standard PageRank algorithm.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

It is very difficult to find relevant information in this rapidly growing hyper structure. Basically web site owner creates web site to provide relevant information to cater user's need. Therefore, it is very important to retrieve web pages based on user's interest and behavior by finding the content of the web page. Link analysis is the significant parameter to find related information. PageRank and HITS are two basic algorithms which works on web structure mining. Numerous algorithms have been developed to improve performance based on these two basic algorithms. An Improved PageRank Algorithm (IPRA), is the extension of the page Rank algorithm, is introduced in this paper. IPRA takes into account the number of different domain inlink and outlink and distributes the rank score based on the reachability of the web pages. The result of our model studies shows that IPRA algorithms give better result than the standard PageRank algorithm.

Key concepts: PageRank, Computer science, Reachability, Web page, Rank (graph theory), Information retrieval, Data mining, Link analysis

Related papers

Back to paper searchBrowse research topicsOriginal source
An Improved PageRank Algorithm Based on Reachability to Reduce Mutual Reinforcement Effect — Research Paper | ScholarLens