Article Fingerprint
ReserarchID
CSTNWSP3KK8
This study is focused on a proposed alternative algorithm for Google’s PageRank, named Hermitian centrality score, which employs complex numbers for scoring a node of the network to overcome the issues of PageRank’s link analysis. This study presents the Hermitian centrality score as a solution for the problems of PageRank, which are associated with the damping factor of Google’s algorithm. The algorithm for Hermitian centrality score is designed to be free from a damping factor, and it reproduces PageRank results well. Moreover, the proposed algorithm can mathematically and systematically change the point of a node of a network.
Keita Sugihara. 2019. \u201cBeyond Google’s PageRank: Complex Number-based Calculations for Node Ranking\u201d. Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 19 (GJCST Volume 19 Issue E3): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 146
Country: Japan
Subject: Global Journal of Computer Science and Technology - E: Network, Web & Security
Authors: Keita Sugihara (PhD/Dr. count: 0)
View Count (all-time): 245
Total Views (Real + Logic): 4926
Total Downloads (simulated): 1236
Publish Date: 2019 10, Mon
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
This study is focused on a proposed alternative algorithm for Google’s PageRank, named Hermitian centrality score, which employs complex numbers for scoring a node of the network to overcome the issues of PageRank’s link analysis. This study presents the Hermitian centrality score as a solution for the problems of PageRank, which are associated with the damping factor of Google’s algorithm. The algorithm for Hermitian centrality score is designed to be free from a damping factor, and it reproduces PageRank results well. Moreover, the proposed algorithm can mathematically and systematically change the point of a node of a network.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.