HW 4

# HW 4 - requirements Google may have returned my target page...

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

Prof. Hoppe CS-103 10/10/07 Homework 4 3. The screen shot I selected shows how Grokker has many advantages over the Google search algorithms. First, I selected a very explicit search term: Disney Marathon Pacing Requirements. This was because I knew that Google would not be able to come up with the exact page for which I was looking. After searching using the Grokker algorithm, I selected the “Disney” search term to close in on my topic. Finally, I was able to locate the exact page I needed: a page that described the cut-off times for the pacing requirements of the Disney Marathon. Google would not have been able to find me the exact page because it would have shown only the main Disney page about the marathon, which does not list the pacing
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: requirements. Google may have returned my target page, but only on a later page. I probably would never have looked that far into the search results. 4. The clustering coefficient for a vertex is the proportion of links between the vertices within its neighborhood divided by the number of links that could possibly exist between them. In this situation, the clustering coefficient of each node would be calculated as below: Node 2: a) N(2) = {V6, V10, V15, V17, V18, V19} b) 18 Possible Edges c) 10 Connected Edges d) C = 10 / 18 Node 8: a) N(8) = {V6, V9, V12, V15, V18, V20} b) 22 Possible Edges c) 11 Connected Edges d) C = 11 / 22 Node 13: a) N(13) = {V5, V9, V11, V12, V14, V16} b) 21 Possible Edges c) 13 Connected Edges d) C = 13 / 21...
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