Agglomerative hierarchical clustering with constraints: theoretical and empirical results
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
| Hi-index | 0.00 |
Abstract: This paper addresses a reliable, feasible method to find geographical areas with constraints using hierarchical depth-first clustering. The method involves multi-level hierarchical clustering with depth-first strategy, depending on whether the area of each cluster is satisfying given constraints. The attributes used in hierarchical clustering are coordinates of grid data points. The constraints are an average value range and the minimum size of area with a small proportion of missing data points. Convex hull and point-in-polygon algorithms [9, 10] are involved in examining the constraint satisfaction. The method is implemented for an Earth science data set, NDVI, for vegetation studies.