Definition of Final step in Girvan-Newman

[ppttzhu]

I found the definition of 'Girvan-Newman algorithm final step' in l05 ambiguous. Wish to have more information if it's in the midterm.

1. According to the definition in l05:
   
   The final step for Girvan-Newman should be repeating until there are k clusters.

2. I would not consider the following step as the final step of Girvan-Newman algorithm, because this is just one step in computing betweenness: calculating credit of edges for one source node.
   

Noticed that this screen-shot is from Mining of Massive Datasets, however, below definition of Girvan-Newman algorithm is not consistent with our lecture note or wiki.

[aronwc]

The caption for figure 10.6 could be expanded to say “the final step to compute the betweenness values for one iteration of Girvan newman”. It is true that this is run many times until k clusters are found.

…

On Oct 13, 2019, at 10:07 PM, Yixin Peng ***@***.***> wrote:  I found the definition of 'Girvan-Newman algorithm final step' in l05 ambiguous. Wish to have more information if it's in the midterm. According to the definition in l05: The final step for Girvan-Newman should be repeating until there are k clusters. I would not consider the following step as the final step of Girvan-Newman algorithm, because this is just one step in computing betweenness: calculating credit of edges for one source node. Noticed that this screen-shot is from Mining of Massive Datasets, however, below definition of Girvan-Newman algorithm is not consistent with our lecture note or wiki. — You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub, or unsubscribe.

[ppttzhu]

The caption for figure 10.6 could be expanded to say “the final step to compute the betweenness values for one iteration of Girvan newman”. It is true that this is run many times until k clusters are found.
…
On Oct 13, 2019, at 10:07 PM, Yixin Peng @.***> wrote:  I found the definition of 'Girvan-Newman algorithm final step' in l05 ambiguous. Wish to have more information if it's in the midterm. According to the definition in l05: The final step for Girvan-Newman should be repeating until there are k clusters. I would not consider the following step as the final step of Girvan-Newman algorithm, because this is just one step in computing betweenness: calculating credit of edges for one source node. Noticed that this screen-shot is from Mining of Massive Datasets, however, below definition of Girvan-Newman algorithm is not consistent with our lecture note or wiki. — You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub, or unsubscribe.

“the final step to compute the betweenness values for one iteration of Girvan newman” is not accurate, because the final step to compute the betweenness values should be:

[aronwc]

Yes I’m

…

On Oct 13, 2019, at 10:31 PM, Yixin Peng ***@***.***> wrote:  The caption for figure 10.6 could be expanded to say “the final step to compute the betweenness values for one iteration of Girvan newman”. It is true that this is run many times until k clusters are found. … On Oct 13, 2019, at 10:07 PM, Yixin Peng @.***> wrote:  I found the definition of 'Girvan-Newman algorithm final step' in l05 ambiguous. Wish to have more information if it's in the midterm. According to the definition in l05: The final step for Girvan-Newman should be repeating until there are k clusters. I would not consider the following step as the final step of Girvan-Newman algorithm, because this is just one step in computing betweenness: calculating credit of edges for one source node. Noticed that this screen-shot is from Mining of Massive Datasets, however, below definition of Girvan-Newman algorithm is not consistent with our lecture note or wiki. — You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub, or unsubscribe. “the final step to compute the betweenness values for one iteration of Girvan newman” is not accurate, because the final step to compute the betweenness values should be: — You are receiving this because you commented. Reply to this email directly, view it on GitHub, or unsubscribe.