Hyperlink-Induced Topic Search (HITS) is also known as hubs and authorities. It is a link analysis algorithm and is used to evaluate the relationship between the nodes in a graph. This algorithm aims to find two different scores for each node in the graph: authority, which indicates the value of the information that the node holds, and hub, which indicates the value of the link information to the other linked nodes to this node. In this recipe, you will learn about HITS and how Gephi is used to compute this metric for a graph.
Considering the directed version of the Les Misérables network, the following steps describe the process of determining the HITS score for a graph in Gephi:
In Gephi's menu bar, click on Window. From the drop-down menu, select Welcome.
In the window that just opened, click on Les Miserables.gexf. This opens up another window.
In the Import Report window, select Graph Type as directed.
With the directed version of Les Mis...