Correct Answer: C. To communicate and explore patterns using graphical encodings
Explanation:
Visualization maps data to visual properties so relationships, trends, and anomalies can be perceived. It supports both analytical discovery and communication to an audience.
Jaccard similarity measures shared neighbors relative to the total distinct neighbors across both users. It ranges from zero for no overlap to one for identical sets.
Correct Answer: B. A focal vertex together with its neighbors and the relevant edges among them
Explanation:
An ego network describes the local social environment surrounding one selected entity. It is useful for studying neighborhood structure and individual network position.
Correct Answer: A. Use eigenvectors of a graph-related matrix to embed and separate vertices
Explanation:
Spectral methods use eigenstructure of matrices such as the graph Laplacian to reveal global connectivity patterns. A selected eigenvector can guide a cut or lower-dimensional graph embedding.
Correct Answer: C. To prevent the trivial solution of placing almost every vertex in one group
Explanation:
Minimizing cut size alone can favor an unhelpful tiny partition separated from the rest. Balance constraints encourage groups of practical or comparable size.
Correct Answer: D. Dividing vertices into groups while optimizing a criterion involving connections across or within groups
Explanation:
Graph partitioning assigns vertices to subsets according to an objective such as minimizing cross-group edges. It is related to, but not always identical with, community detection.
Correct Answer: A. Many shortest paths between different regions pass through them
Explanation:
A bridge between otherwise dense regions carries a large fraction of cross-region shortest paths. Removing high-betweenness edges can therefore separate communities in divisive algorithms.
Correct Answer: B. Vertices repeatedly adopt labels common among their neighbors
Explanation:
Local label updates allow densely connected regions to converge toward shared community identifiers. The method directly discovers groups without requiring labeled training examples.
Correct Answer: A. How much more densely connected the proposed communities are than expected under a reference network
Explanation:
Modularity compares observed within-community edges with an expected baseline that preserves aspects such as degree. Higher modularity suggests stronger community structure under that comparison.
Correct Answer: D. A community can have links to other communities, while a connected component has no path to outside components
Explanation:
Community boundaries reflect relatively stronger internal connectivity, not total separation. Connected components are separated absolutely because no path crosses between them.