MathJax


Tuesday, June 15, 2021

2021-038

The Hierarchical clustering algorithm helps to uncover the community structure of large real networks. Look at the Dendrogram below and choose the correct community organization, based on the red line cut:




  1. 11 communities found: A | B | C | D | E | F | G | H | I | J | K
  2. 8 communities found: A, B | C | D | E, F | G | H | I, J | K
  3. 5 communities found: A, B, C | D | E, F, G | H | I, J, K
  4. 3 communities found: A, B, C | D, E, F, G | H, I, J, K
  5. None of the above

 

Original idea by: Mauricio Schiezaro

at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2025-310

Which of the following alternatives contains a graph with only one Strongly Connected Component (SCC)?  a) b) c)  d)   e) None of the above ...

  • 2021-028
     When a Bianconi-Barabási model reduces to a Barabási-Albert model? When the degree distribution is a normal distribution When the fitnes...
  • 2022-181
    The Kosaraju-Sharir algorithm is an algorithm used to find strongly connected components in a graph. Applying the algorithm on the graph...
  • 2021-009
    Find the derivative of $$ f(t) = \frac{1}{t} − \frac{1}{2t^3} + \frac{1}{2t^5} $$. \( f'(t) = \dfrac{1}{t} − \dfrac{1}{2t^3} + \dfra...