5.1 SKATER
Last updated
Was this helpful?
Last updated
Was this helpful?
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
Short version 1:
Short version 2:
Short version 3:
Full version 1:
Full version 2:
Name
Type
Description
k
integer
the number of clusters
vals
anyarray
an array of the numeric columns that contains the values for skater
weights
bytea
a bytea column that stores the spatial weights information
bound_val
numeric
the numeric column of bound variable
min_bound
float
the minimum bound value that applies to all clusters
scale_method
character varying
the scaling method applies on vals. Options are {'raw', 'standardize', 'demean', 'mad', 'range_standardize', 'range_adjust'}. Default: 'standardize'
distance_method
character varying
the distance metric used to measure the distance in attribute space of input vals. Options are {'euclidean', 'manhattan'. Default: 'euclidean'.
seed
integer
the seed for random number generator used in LISA statistics. Default: 123456789.
cpu_threads
integer
the number of cpu threads used for parallel LISA computation. Default: 6.
Type
Description
integer
the cluster indicator
Use k=0 if you don't know the number of regions. The algorithm will use the bound information (e.g. minimum size of each region, or bound variable, e.g. population, with minimum bound value) to find the best solution.
Apply skater to create 10 spatially constrained clusters using variable ["hr60", "ue60", "dv60"] (homicide, unemployment, divorce rate 1960 in ) and queen contiguity weights "queen_w":
Please see chapter '' for how to create a Queen contiguity weights.