Adyanata Lubis
Program Study Computer Science, Universitas Rokania, Riau, Indonesia

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Implementation of PageRank Algorithm for Visualization and Weighting of Keyword Networks in Scientific Papers Adyanata Lubis; Elyandri Prasiwiningrum
Journal of Applied Data Sciences Vol 4, No 4: DECEMBER 2023
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v4i4.138

Abstract

Papers are written works that contain thoughts about a particular problem or topic that are written systematically accompanied by logical analysis. Scientific papers are often found on the internet or in libraries for various titles of scientific papers, citations or references can be found in every scientific paper and can be obtained easily, but to display all citations in scientific papers in the form of visualization cannot be done easily. Visualizing the citation network of scientific papers in the form of a graph, with nodes representing research papers and edges representing the relationship between researchers' scientific papers and other scientific papers based on scientific paper citations. This research uses the pagerank algorithm to create a keyword network that has a high relationship and potential relevance in a data library. This research is the first research in using the pagerank algorithm and testing its accuracy by comparing with KNN and linear clustering. The presentation displays the citation of scientific papers based on the size of the node by showing the number of citations of the scientific paper. It can be concluded that all processes in the system have run according to design, and functionally the visualization system and weighting of the scientific paper citation network are in accordance with the design. The results obtained from 51 articles, this algorithm produces a visual user interest of 81.60%, compared to the accuracy of the data suitability produced by the linear clustering and KNN algorithms in the form of 71.22% and 61.34%, helping to facilitate the search for scientific papers in large quantities.