1. The PageRank algorithm The Anatomy of a Large-Scale Hypertextual Web Search Engine Sergey Brin and Lawrence Page, 1998 David Pinto Faculty of Computer Science, BUAP

2. Introduction

3. The PageRank algorithm Let G= be a directed graph  V = vertex of G  E = edges of G, E  V  V  For v i  V, Let In(v i ) be the set of vertices that point to v i Let Out(v i ) be the set of vertices that v i points to

4. 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.

5. Keyword extraction

6. Summaries by extraction

9. Questions? David Pinto, FCC, BUAP