A PageRank Algorithm based on Asynchronous Gauss-Seidel Iterations

We address the PageRank problem of associating a relative importance value to all web pages in the Internet so that a search engine can use them to sort which pages to show to the user. This precludes finding the eigenvector associated with a particular eigenvalue of the link matrix constructed from...

ver descrição completa

Detalhes bibliográficos
Autor principal: Silvestre, Daniel (author)
Outros Autores: Hespanha, João (author), Silvestre, Carlos (author)
Formato: article
Idioma:eng
Publicado em: 2018
Assuntos:
eigenvalues and eigenfunctions
graph theory
Internet
iterative methods
matrix algebra
search engines
topology
asynchronous version
Gauss-Seidel method
traditional power method
sparse link matrix
linear equations
page ranks
asynchronous algorithm
PageRank algorithm
asynchronous Gauss-Seidel iterations
PageRank problem
relative importance value
web pages
search engine
topology graph
sequential update
link matrix eigenvalue
Program processors
Convergence
Mathematical model
Eigenvalues and eigenfunctions
Web pages
Search engines
Tools
Texto completo:http://hdl.handle.net/11144/3875
País:Portugal
Oai:oai:repositorio.ual.pt:11144/3875

Texto Completo

http://hdl.handle.net/11144/3875

Registos relacionados