This node is currently not available in KNIME v5.9 — instead we’re showing this page for KNIME v4.7. You can use the version menu in the title bar to permanently switch your preferred version. This will also show the link to the update site.
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!
Options
Views
- This node has no views
Workflows
- No workflows found
Links
- No links available
Developers
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.