問題文
A publisher projects a citation network in which each CITES relationship points from the citing paper to the cited paper. They want a score that reflects not just how many papers cite a given paper, but how important those citing papers are. Which algorithm matches that requirement?
選択肢
- Betweenness Centrality, which scores a node by how many shortest paths between other pairs of nodes pass through it on the way from one node to the other.
- Degree Centrality, which counts the relationships attached to each node and reports that count as the score for the node in the result.
- Triangle Count, which counts for each node the number of sets of three nodes where every node has a relationship to the other two, and is often used to judge how cohesive a group is.
- PageRank, which scores a node from the number of incoming relationships and the importance of the nodes that those relationships come from.