PageRank mutation

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

PAKSIMA JAVAD

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT) Year:2019 | Volume:8 | Issue:3 Page(s): 52-59

Download Full-Text

Persian Verion

View:

462

Download:

Cites:

Information Journal Paper

Title

PageRank mutation

Author(s)

PAKSIMA JAVAD | Issue Writer Certificate

Keywords

RankingQ1

PageRankQ1

Web-GraphQ1

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.

Cites

No record.

References

No record.

Cite

APA: Copy

PAKSIMA, JAVAD. (2019). PageRank mutation. JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT), 8(3 ), 52-59. SID. https://sid.ir/paper/245854/en

Vancouver: Copy

PAKSIMA JAVAD. PageRank mutation. JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT)[Internet]. 2019;8(3 ):52-59. Available from: https://sid.ir/paper/245854/en

IEEE: Copy

JAVAD PAKSIMA, “PageRank mutation,” JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT), vol. 8, no. 3 , pp. 52–59, 2019, [Online]. Available: https://sid.ir/paper/245854/en

Related Journal Papers