Beyond Google2019;s PageRank: Complex Number-based Calculations for Node Ranking
Keywords:
search engine, PageRank, damping factor, complex number, hermitian adjacency matrix
Abstract
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 PageRank2019;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 Google2019;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.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2019-07-15
Issue
Section
License
Copyright (c) 2019 Authors and Global Journals Private Limited
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.