Question 6
Consider the following network:
The Girvan–Newman algorithm detects communities by iteratively removing edges with the highest edge betweenness centrality.
Which edge is most likely to be removed first?
a) (2,4)
b) (4,6)
c) (4,5)
d) (3,7)
e) None of the above.
Original idea by George Gigilas Junior
Betweenness centrality is costly to calculate. My would be (7,8), b ut I need to check.
ResponderExcluirHmm maybe I misunderstood it, but I thought it would be (3,7). There is just one path per node that crosses (7,8)
ResponderExcluirYou're right. I tested it with a program. But the question is, people will not have access to a program in the exam.
ResponderExcluirFair point
ResponderExcluir