Label Propagation

Uses the Flink Gelly implementation of the label propagation algorithm. The iterative algorithm detects communities by propagating a given property key - called label. In each iteration, a vertex adopts the label that is most frequent among its neighbors' labels.

Options

Maximum Iterations
Set the maximum number of iterations.
Property Key
Set the key of the property for the label propagation.

Input Ports

Icon
One single logical graph.

Output Ports

Icon
The same logical graph where each node has the label that is most common amongst its neighbors.

Popular Predecessors

  • No recommendations found

Popular Successors

  • No recommendations found

Views

This node has no views

Workflows

  • No workflows found

Links

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.