lecture17-linkanalysis-handout-6-per

Gets at a broader slice of common opinion introducon

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: envector of P with the largest eigenvalue.)   Transi*on probability matrices always have largest eigenvalue 1.   Given graph of links, build matrix P.   From it compute a – lel eigenvector of P.   The entry ai is a number between 0 and 1: the pagerank of page i.   Query processing:   Retrieve pages mee*ng query.   Rank them by their pagerank.   But this rank order is query ­independent … 5 Introduc)on to Informa)on Retrieval Introduc)on to Informa)on Retrieval Sec. 21.3 The reality Hyperlink ­Induced Topic Search (HITS)   Pagerank is used in google and other engines, but is hardly the full story of ranking   In response to a query, instead of an ordered list of pages each mee*ng the query, find two sets of inter ­ related pages:   Many sophis*cated features are used   Some address specific query classes   Machine learned ranking (Lecture 19) heavily u...
View Full Document

Ask a homework question - tutors are online