The PageRank algorithmThe Anatomy of a Large-Scale Hypertextual Web Search Engine

Sergey Brin and Lawrence Page, 1998

David Pinto

Faculty of Computer Science, BUAP

Introduction

The PageRank algorithm

Let G=<V,E> be a directed graph V = vertex of G E = edges of G, E ⊆ V×V

For vi ∈ V, Let In(vi) be the set of vertices that point to vi

Let Out(vi) be the set of vertices that vi points to

The PageRank algorithm

d=0.85, representa la probabilidad de que un navegante continúe pulsando links al navegar por Internet en vez de escribir una url directamente en la barra de direcciones o pulsar uno de sus marcadores.

Keyword extraction

Summaries by extraction

Summaries by extraction

Summaries by extraction

Questions?

David Pinto, FCC, BUAP