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.
Do you have feedback, questions, comments about NodePit, want to support this platform, or want your own nodes or workflows listed here as well? Do you think, the search results could be improved or something is missing? Then please get in touch! Alternatively, you can send us an email to email@example.com, follow @NodePit on Twitter, or chat on Gitter!
Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.