Learn R Programming

HCV (version 1.2.0)

Hierarchical Clustering from Vertex-Links

Description

Hierarchical clustering for spatial data, which requires clustering results not only homogeneous in non-geographical features among samples but also geographically close to each other within a cluster. It modified typically used hierarchical agglomerative clustering algorithms for introducing the spatial homogeneity, by considering geographical locations as vertices and converting spatial adjacency into whether a shared edge exists between a pair of vertices (Tzeng & Hsu, 2022) . The constraints of the vertex links automatically enforce the spatial contiguity property at each step of iterations. In addition, methods to find an appropriate number of clusters and to report cluster members are also provided.

Copy Link

Version

Install

install.packages('HCV')

Monthly Downloads

9

Version

1.2.0

License

LGPL-3

Maintainer

ShengLi Tzeng

Last Published

February 22nd, 2022

Functions in HCV (1.2.0)

synthetic_data

Generating Point-level Data Having Several Groups
tessellation_adjacency_matrix

Adjacency Matrix from Tessellation
HCV

Hierarchical Clustering from Vertex-links
getCluster

Determining Appropriate Clusters for HCV Objects
plotMap

Drawing a Thematic Map with a Quantitative Feature