Computation of the PageRank scores for the vertices in a logical graph. Uses the Flink Gelly implementation of PageRank and computes a per-vertex score which is the sum of PageRank scores transmitted over in-edges. Each vertex's score is divided evenly among out-edges. High-scoring vertices are linked to by other high-scoring vertices; this is similar to the 'authority' score in HITS (see http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf). The current implementation excludes vertices with a degree of zero from the 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.
Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.Try NodePit Runner!
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.