• Corpus ID: 246063826

The R Package HCV for Hierarchical Clustering from Vertex-links

  title={The R Package HCV for Hierarchical Clustering from Vertex-links},
  author={Shengli Tzeng and Hao-Yun Hsu},
The HCV package implements the hierarchical clustering for spatial data. It requires clustering results not only homogeneous in non-geographical features among samples but also geographically close to each other within a cluster. We modified typically used hierarchical agglomerative clustering algorithms to introduce the spatial homogeneity, by considering geographical locations as vertices and converting spatial adjacency into whether a shared edge exists between a pair of vertices. The main… 




The methodology is employed to create clusters of Brazilian municipalities, for the year 2000, based on a group of socio-economic variables, and several clustering methods are investigated, as well as several types of vector distances.

Efficient regionalization techniques for socio‐economic geographical units using minimum spanning trees

The results show that the proposed method for regionalization combines performance and quality, and it is a good alternative to other regionalization methods found in the literature.

ClustGeo: an R package for hierarchical clustering with spatial constraints

A Ward-like hierarchical clustering algorithm including spatial/geographical constraints including spatial and geographical constraints is proposed, illustrated on a real dataset using the R package ClustGeo.

Clustering spatial data with a geographic constraint: exploring local search

A connective dual clustering problem with an explicit connected constraint given to derive clusters that contain objects with similar values in the optimization domain and are connected in the geographic domain is formulates.

DCAD: a dual clustering algorithm for distributed spatial databases

The DCAD algorithm is proposed to solve the dual clustering problem in distributed databases where constraints are imposed on the clustering goal from both geometrical and non-geometrical domains simultaneously.

Density-based Clustering

  • M. Ester
  • Computer Science, Business
    Encyclopedia of Database Systems
  • 2009
The clustering methods like K-means or Expectation-Maximization are suitable for finding ellipsoid-shaped clusters, but for non-convex clusters, these methods have trouble finding the true clusters, since two points from different clusters may be closer than two points in the same cluster.

Dual clustering: integrating data clustering over optimization and constraint domains

An efficient and effective algorithm, named Interlaced Clustering-Classification, abbreviated as ICC, is devised, which combines the information in both domains and iteratively performs a clustering algorithms on the optimization domain and also a classification algorithm on the constraint domain to reach the target clustering effectively.

SPODT: An R Package to Perform Spatial Partitioning

A new R package, SPODT, is proposed, which provides an extensible set of functions for partitioning spatial and spatio-temporal data, and enables extended analyses of spatial data, providing inference, graphical representations, spatio/temporal analysis, adjustments on covariates, spatial weighted partition, and the gathering of similar adjacent final classes.

M3C: A Monte Carlo reference-based consensus clustering algorithm

A reference-based consensus clustering algorithm called M3C is developed, which uses a Monte Carlo simulation to generate null distributions along the range of K, which are used to decide its value and reject the null hypothesis.

Defining Geographical Rating Territories in Auto Insurance Regulation by Spatially Constrained Clustering

This study illustrated the usefulness of the spatially-constrained clustering approach in defining geographical rating territories for insurance rate regulation purposes and proposed method can be useful for other demographical data analysis because of the similar nature of the spatial constraint.