Description Usage Arguments Value Author(s) References Examples
This function is implementation of Kruskal Clustering for input of spatial distances.
1 2 | exClusterByKruskal(spcoords, mininterClusterDist = 8000,
dist_scalor = 1000)
|
spcoords |
Data frame with the columns of x and y coordinates. |
mininterClusterDist |
Minimum intercluster distance used in Kruskal clustering. |
dist_scalor |
Scaling factor for the coordinates to avoid overflow by using too big integers. |
A list: (clusterid,clsCenter,sumCls,withinss,tot.withinss)
clusterid |
Cluster id for every row of the input data |
clsCenter |
Central coordinates for each the cluster |
sumCls |
Frequency summary for each cluster |
withinss |
Vector of within-cluster sum of squares, one component per cluster. |
tot.withinss |
Total within-cluster sum of squares, i.e. sum(withinss) |
Lianfa Li lspatial@gmail.com
Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society. 7: 48–50. doi:10.1090/S0002-9939-1956-0078686-7. JSTOR 2033241.
1 2 3 4 5 6 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.