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.
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.
To use this node in KNIME, install the extension Gradoop-Integration from the below update site following our NodePit Product and Node Installation Guide:
Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.
Try NodePit Runner!