フリー問題

Neo4j Graph Data Science Certification のフリー問題 10 / 20 問目

問題文

How does Label Propagation decide which community a node belongs to as it iterates?

選択肢

  1. Each node takes the label held by the largest number of its neighbors, and the process repeats until every node holds the majority label of its neighbors.
  2. Each node is assigned to the community whose centroid is nearest to it in the space formed by its numeric properties, and the centroids are recomputed after every round of assignments.
  3. Each node keeps the label it started with unless a weight says otherwise, and the labels of its neighbors are left aside.
  4. Each node joins the community that gives the largest increase in modularity, which the algorithm recomputes for each candidate on each round.

解答・解説を確認するには

正解と解説の確認、回答の記録には無料登録が必要です。登録すると演習モードでフリー問題に回答し、正誤と解説をその場で確認できます。