Beyond Google’s PageRank: Complex Number-based Calculations for Node Ranking

α
Keita Sugihara
Keita Sugihara
α Nanzan University Nanzan University

Send Message

To: Author

Beyond Google’s PageRank: Complex Number-based Calculations for Node Ranking

Article Fingerprint

ReserarchID

CSTNWSP3KK8

Beyond Google’s PageRank: Complex Number-based Calculations for Node Ranking Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

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 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.

References

13 Cites in Article
  1. Sergey Brin,Lawrence Page (1998). The anatomy of a large-scale hypertextual Web search engine.
  2. L Page,S Brin (1999). The Page Rank Citation Ranking: Bringing Order to the Web.
  3. M (2015). The Anatomy of Web Search Engines and Large-Scale Alterations in Rankin Algorithms.
  4. K Sugihara (2019). Using Complex Numbers in Website Ranking Calculations: A Non-ad hoc Alternative to Google's PageRank.
  5. Jimmy Lin,Chris Dyer (2010). Data-Intensive Text Processing with MapReduce.
  6. A Lang,C Meyer (2006). Google's Page Rank and beyond THE SCIENCE OF SEARCH ENGINE RANKINGS.
  7. Carl Meyer (2000). Matrix Analysis and Applied Linear Algebra.
  8. S Wasserman,K Faust (2007). Social Network Analysis Methods and Applications.
  9. Amy Langville,Carl Meyer (2012). Who's #1?.
  10. P Boldi (2007). A Deeper Investigation of Page Rank as a Function of the Damping Factor.
  11. H.-H Fu,D Lin,H.-T Tsai (2006). Damping factor in Google page ranking.
  12. Paolo Boldi (2005). TotalRank.
  13. Phillip Bonacich (1972). Factoring and weighting approaches to status scores and clique identification.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

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): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-E Classification: F.2.1
Version of record

v1.2

Issue date

October 14, 2019

Language
en
Experiance in AR

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.

Read in 3D

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.

Article Matrices
Total Views: 4926
Total Downloads: 1236
2026 Trends
Related Research

Published Article

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.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Beyond Google’s PageRank: Complex Number-based Calculations for Node Ranking

Keita Sugihara
Keita Sugihara Nanzan University

Research Journals