lecture17-linkanalysis-handout-6-per

Stores mappings in memory from url to outlinks url to

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Miasa E&J school _ ސ쌧E‰¡•lŽs—§ †ì¼¬ŠwZ‚̃y http://www...p/~m_maru/index.html fukui haruyama-es HomePage Torisu primary school goo Yakumo Elementary,Hokkaido,Japan FUZOKU Home Page Kamishibun Elementary School... 7 Introduc)on to Informa)on Retrieval Sec. 21.3 Things to note Introduc)on to Informa)on Retrieval S ec. 21.3 Proof of convergence   Pulled together good pages regardless of language of page content.   Use only link analysis aler base set assembled   itera*ve scoring is query ­independent.   Itera*ve computa*on aler text index retrieval  ­ significant overhead.   n×n adjacency matrix A:   each of the n pages in the base set has a row and column in the matrix.   Entry Aij = 1 if page i links to page j, else = 0. 1 2 1 0 2 1 3 0 2 1 1 1 1 1 0 0 3 3 Introduc)on to Informa)on Retrieval Sec. 21.3 Introduc)on to Informa)on Retrieval Hub/authority vectors Rewri...
View Full Document

This document was uploaded on 02/26/2014.

Ask a homework question - tutors are online