Department of Computer, Payame Noor University, Iran
Abstract
The PageRank algorithm is one of the web based classification methods used by Google search engine first. The main purpose of this algorithm was to determine the popularity of Web pages. The algorithm uses the web links structure to find important pages. One of the problems of PageRank and the same algorithms based on the web graph is that the number of a page is propagated to its output pages without any control while the output screen really is not really recommended by the previous page directly or indirectly. In this paper, by changing the original formula PageRank, a method has been proposed to prevent the entry of the input bonds to a single page of publication without gaining popularity. In order to evaluate the proposed algorithm, a single web graph is constructed, which in some nodes has a rating leap. This mutation decreases after the proposed algorithm is applied.
)