COMPSCI 753 Algorithms for Massive Data - Semester2 2021- Final Exam - Q3 Algorithms for Graphs
This question has been solved
3 Algorithms for Graphs
CourseNana.COM
3.1 Biased PageRank
CourseNana.COM
Given a directed graph:
CourseNana.COM
CourseNana.COM
1. We have learnt the matrix formulation of PageRank r = M · r. Convert the above graph to a column-stochastic adjacency matrix. [1 mark]
CourseNana.COM
2. Compute the PageRank of the graph above. [2 marks]
CourseNana.COM
3. Let β = 0.8, calculate the biased PageRank with the teleport set S = {[the last digit of your student ID] mod 4}. [3 marks]
CourseNana.COM
Note: The rank of each node should round to 3 decimal places.
CourseNana.COM
3.2 Community Detection
CourseNana.COM
1. Use two or three sentences to explain the differences between modularity maximization and the Girvan-Newman algorithm for community detection. [2 marks]
CourseNana.COM
CourseNana.COM
2. In the modularity maximization algorithm, which pair of nodes in the graph below should be merged in the first step to maximize the gain of modularity? Explain your answer. If there are multiple pairs of nodes with the same modularity gain, report all of them to get full mark. [4 marks]
CourseNana.COM
CourseNana.COM
3.3 Influence Maximization
CourseNana.COM
1. Compute the influence spread of the seed set S = {1} using the Independent Cascade (IC) model on the following graph. [2 marks]
CourseNana.COM
CourseNana.COM
2. In the lecture, we have learnt a greedy algorithm to find a seed set for maximizing the influence based on the IC model. Starting with empty seed set, which node will be the first to be added to the seed set in the greedy algorithm? [2 marks]
CourseNana.COM
CourseNana.COM
COMPSCI 753代写,Algorithms for Massive Data代写,Auckland代写,澳洲代写,Algorithms for Graphs代写,PageRank代写,COMPSCI 753代编,Algorithms for Massive Data代编,Auckland代编,澳洲代编,Algorithms for Graphs代编,PageRank代编,COMPSCI 753代考,Algorithms for Massive Data代考,Auckland代考,澳洲代考,Algorithms for Graphs代考,PageRank代考,COMPSCI 753help,Algorithms for Massive Datahelp,Aucklandhelp,澳洲help,Algorithms for Graphshelp,PageRankhelp,COMPSCI 753作业代写,Algorithms for Massive Data作业代写,Auckland作业代写,澳洲作业代写,Algorithms for Graphs作业代写,PageRank作业代写,COMPSCI 753编程代写,Algorithms for Massive Data编程代写,Auckland编程代写,澳洲编程代写,Algorithms for Graphs编程代写,PageRank编程代写,COMPSCI 753programming help,Algorithms for Massive Dataprogramming help,Aucklandprogramming help,澳洲programming help,Algorithms for Graphsprogramming help,PageRankprogramming help,COMPSCI 753assignment help,Algorithms for Massive Dataassignment help,Aucklandassignment help,澳洲assignment help,Algorithms for Graphsassignment help,PageRankassignment help,COMPSCI 753solution,Algorithms for Massive Datasolution,Aucklandsolution,澳洲solution,Algorithms for Graphssolution,PageRanksolution,
