Hyperlink-Induced Topic Search computes two interdependent scores for every vertex in a directed graph. A good "hub" links to good "authorities" and good "authorities" are linked from good "hubs". This algorithm can be configured to terminate either by a limit on the number of iterations, a convergence threshold, or both. Authority and Hub properties are stored in the vertices of the output logical graph.


authority Property Key
The property key to store the authority score.
Hub Property Key
The property key to store the hub score.
Max. Iterations
The number of maximum iterations.
Convergence Threshold
Set the convergence threshold for sum of scores.

Input Ports

One single logical graph.

Output Ports

Same graph with added hub/authority attributes on each vertex.

Popular Predecessors

  • No recommendations found

Popular Successors

  • No recommendations found


This node has no views


  • No workflows found



You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.