VISUALIZATION OF PAGERANK ALGORITHM

Ervin Perhaj (2013) VISUALIZATION OF PAGERANK ALGORITHM. EngD thesis.

Preview

Abstract

The goal of the thesis is to develop a web application that help users understand the functioning of the PageRank algorithm. The thesis consists of two parts. First we develop an algorithm to calculate PageRank values of web pages. The input of algorithm is a list of web pages and links between them. The user enters the list through the web interface. From the data the algorithm calculates PageRank value for each page. The algorithm repeats the process, until the difference of PageRank values between iterations is less than 0,0001. In the second part, we develop visualization of PageRank algorithm. The user can build his/her own network or select one of precreated ones. Web pages are represented as directed or undirected graphs, the size of the nodes represents PageRank value.

Item Type:

Thesis (EngD thesis)

Keywords:

PageRank algorithm, website ranking, web application, visualization

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
doc. dr. Marko Robnik Šikonja	276	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=10364756)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

2251

Date Deposited:

21 Oct 2013 17:15

Last Modified:

15 Jan 2014 13:24

URI:

http://eprints.fri.uni-lj.si/id/eprint/2251

Actions (login required)

View Item