フリー問題

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

問題文

The documentation describes one centrality algorithm as a variant of another with an additional jump probability. Which pair does that describe, and which is the variant?

選択肢

  1. Harmonic Centrality is the variant of Closeness Centrality with a jump probability added to the formula that it uses.
  2. PageRank is the variant of Eigenvector Centrality, and the jump probability is what the damping factor expresses.
  3. Article Rank is the variant of Eigenvector Centrality, and the jump probability lowers the influence that nodes with few outgoing relationships pass on to their neighbors.
  4. Eigenvector Centrality is the variant of PageRank, obtained by removing the damping factor from the computation of the score for each node.

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

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