フリー問題

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

問題文

A retailer has a BOUGHT relationship from customers to products and simply wants to list the products with the largest number of direct purchases, with no notion of transitive influence. What is the most economical choice?

選択肢

  1. Node Similarity, which compares nodes by the sets of neighbors they share and produces a score for each pair of nodes that have outgoing relationships in the graph.
  2. PageRank, because it also measures the popularity of each node and its score rises with the number of purchases that a product receives from the customers.
  3. Degree Centrality with the orientation set so that incoming purchases are counted, since the direct count is what the question asks for.
  4. Betweenness Centrality, which requires the shortest paths between all pairs of nodes to be computed and therefore reports which products sit on the routes that connect the rest of the graph together.

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

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