All examples By author By category About

Jverma

Understanding PageRank in a network graph

Visualizing pagerank of nodes in a graph.

Example studied is that of extracting most informative sentences from a textual document for auto summarization. Uses the LexRank algorithm. A graph G is created where :

LexRank asserts that PageRank (now called LexRank) scores of sentences in such a graph can be used to rank sentences in the order of their relevance to the document. And in turn, can be used for generating a summary of teh document.

Usage: