Spatial C(K)luster Analysis by Tree Edge Removal (SKATER) is an optimized algorithm to prune the minimum spanning tree into several clusters that their values of selected variables are as similar as possible while retaining the contiguity structure. For more information, please read https://geodacenter.github.io/workbook/9c_spatial3/lab9c.html#skater
skater()
function skater(
WeightResult w,
Number k,
Array vals,
Number min_bound,
Array bound_vals,
String scale_method,
String distance_type)
Arguments
Name
Type
Description
weights
WeightsResult
The weights object WeightsResult
k
Number
The number of clusters
values
Array
The list of numeric vectors of selected variable
min_bound
Number
The minimum value that the sum value of bounding variable int each cluster should be greater than
bound_vals
Array
The numeric vector of selected bounding variable
scale_method
String
The scaling method: {'raw', 'standardize', 'demean', 'mad', 'range_standardize', 'range_adjust'}
distance_method
String
The distance method: {"euclidean", "manhattan"}
Return
Type
Description
ClusteringResult
The Clustering object: {'total_ss', 'within_ss', 'between_ss', 'ratio', 'clusters'}