The Spatial C(K)luster Analysis by Tree Edge Removal (SKATER). The Spatial C(K)luster Analysis by Tree Edge Removal (SKATER) algorithm introduced by Assuncao et al. (2006) is based on the optimal pruning of a minimum spanning tree that reflects the contiguity structure among the observations. It provides an optimized algorithm to prune to tree into several clusters that their values of selected variables are as similar as possible.
The node is based on the package pygeoda and here are related tools and references:
The number of user-defined clusters.
The seed for the random number generator.
Select the geometry column to implement spatial clustering.
Select the bound column for clusters with minibound.
Select columns for calculating attribute distance.
The sum of the bounding variable in each cluster must be greater than this minimum value.
Input spatial weight mode.
Available options:
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 Geospatial Analytics Extension for KNIME from the below update site following our NodePit Product and Node Installation Guide:
A zipped version of the software site can be downloaded here.
Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.
Try NodePit Runner!