CS-103 HW 8

CS-103 HW 8 - CS-103 Bruce Hoppe November 1, 2007 Homework...

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: CS-103 Bruce Hoppe November 1, 2007 Homework 8 1) 2) 3) W=1 23 Nodes 4) 5) 6) SE(2,8) = 2,15,8 OR 2,18,8 SE(1,20)= 1,17,2,18,20 OR 1,4,2,6,20 You do not have to submit anything yet for this problem. Just think about it and be ready for the question to come up again. PageRank is a link analysis algorithm that assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of "measuring" its relative importance within the set. The algorithm may be applied to any collection of entities with reciprocal quotations and references. Google assigns a numeric weighting from 0-10 for each webpage on the Internet; this PageRank denotes your site's importance in the eyes of Google. The scale for PageRank is logarithmic like the Richter Scale and roughly based upon quantity of inbound links as well as importance of the page providing the link. (From Wikipedia, Page Rank Article) ...
View Full Document

This note was uploaded on 04/14/2008 for the course CS 103 taught by Professor Hoppe during the Fall '07 term at BU.

Ask a homework question - tutors are online