PageRank algorithm, structure, dependency, improvements and beyond.

Langbroek, D.A. (2015) PageRank algorithm, structure, dependency, improvements and beyond. Bachelor's Thesis, Mathematics.

Preview	Text Googlepagerank.pdf - Published Version Download (639kB) | Preview
	Text Toestemming1.pdf - Other Restricted to Registered users only Download (59kB)

Abstract

I present an explanation about the PageRank algorithm πT = πTG. Background of G = αH +(αa+(1−α)e)1 net and construction of the matrix H and G while dealing with danglingnodes. I cover the sensitivity of πT to changes in the algorithm and structure of the web. I look at a method to improve upon the PageRank algorithm by changing vT, and implementing a back button for dangling nodes. Moreover I cover the adaptive power method to decrease the number of computations needed per iteration and extrapolation methods to decreasse the number of iterrations required for convergence. While also looking at the storage of the massive matrices. Consider the accuracy of the ranking of the pages. Including proves of the spectrum of G, the power method iteration and the convergence of πT = πTG. Additionally a look at the HITS algorithm and other search engine algorithms. Included an example of the PageRank algorithm on a 15 page web graph and experiment with different α, πT(0), vT and accuracy arguments.

Item Type:	Thesis (Bachelor's Thesis)
Degree programme:	Mathematics
Thesis type:	Bachelor's Thesis
Language:	English
Date Deposited:	15 Feb 2018 08:05
Last Modified:	15 Feb 2018 08:05
URI:	https://fse.studenttheses.ub.rug.nl/id/eprint/12910

Actions (login required)

View Item