This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: A B C D E F G H Draw a graph with 10 nodes 1) such that 1 node clearly has the highest PageRank Link Analysis  Exercises Link Analysis  Exercises Draw a graph with 10 nodes 2) such that 4 nodes have very high and equal PageRank Link Analysis  Exercises Link Analysis  Exercises Draw a graph with 10 nodes 3 ) such that no node has the same PageRank Link Analysis  Exercises Link Analysis  Exercises How could PageRank be calculated in Hadoop? Link Analysis  Exercises input: node_a:[ P(node_a), [node_b,node_c] ] map out: [node_b, P(node_a)/2] [node_c, P(node_a)/2] [node_a,[node_b,node_c]] reduce in: node_x: [P(in1),…,P(in3)….[node_y,node_z]] reduce out: node_x: [sum(P(in1)…P(in3)),[node_y,node_z] ] Link Analysis  Exercises...
View
Full Document
 Winter '08
 Patterson,D
 Larry Page, PageRank, link analysis, TrustRank, Hinrich Schütze

Click to edit the document details