A PageRank Algorithm based on Asynchronous Gauss-Seidel Iterations
Traditional PageRank -Compute relative importance of each webpage in the network. Ranking of Researchers - PageRank has also been proposed to be an alternative to citation count. General Ranking - Since PageRank is equivalent to the relative time spent in a node for a random walk on the graph many m...
| Autor principal: | |
|---|---|
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2018
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/11144/3885 |
| País: | Portugal |
| Oai: | oai:repositorio.ual.pt:11144/3885 |
| Resumo: | Traditional PageRank -Compute relative importance of each webpage in the network. Ranking of Researchers - PageRank has also been proposed to be an alternative to citation count. General Ranking - Since PageRank is equivalent to the relative time spent in a node for a random walk on the graph many more applications are possible. |
|---|