A Hybrid Numerical Algorithm for Computing Page Rank

Waiki Ching (), Michael K. Ng () and Waion Yuen
Additional contact information
Waiki Ching: The University of Hong Kong, Department of Mathematics
Michael K. Ng: The University of Hong Kong, Department of Mathematics
Waion Yuen: The University of Hong Kong, Department of Mathematics

A chapter in Current Trends in High Performance Computing and Its Applications, 2005, pp 257-264 from Springer

Abstract: Summary The computation of PageRank is an important issue in Internet. Especially one has to handle a huge size of web with its size growing rapidly. In this paper, we present an adaptive numerical method for solving the PageRank problem. The numerical method combines the Jacobi Over-Relaxation (JOR) method with the evolutionary algorithm. Numerical examples based on simulations are given to demonstrate the efficiency of the proposed method.

Keywords: Markov Chain; Evolutionary Algorithm; Hybrid Algorithm; Relaxation Parameter; Outgoing Link (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-27912-9_28

Ordering information: This item can be ordered from
http://www.springer.com/9783540279129

DOI: 10.1007/3-540-27912-1_28

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().