By Topic

A feasible method to find areas with constraints using hierarchical depth-first clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kwang-Su Yang ; Sch. of Comput. Sci., George Mason Univ., Fairfax, VA, USA ; Ruixin Yang ; Kafatos, M.

Addresses a reliable, feasible method to find geographical areas with constraints using hierarchical depth-first clustering. The method involves multi-level hierarchical clustering with a depth-first strategy, depending on whether the area of each cluster satisfies the given constraints. The attributes used in the hierarchical clustering are the coordinates of the grid data points. The constraints are an average value range and the minimum size of an area with a small proportion of missing data points. Convex-hull and point-in-polygon algorithms are involved in examining the constraint satisfaction. The method is implemented for an Earth science data set for vegetation studies - the Normalized Difference Vegetation Index (NVDI)

Published in:

Scientific and Statistical Database Management, 2001. SSDBM 2001. Proceedings. Thirteenth International Conference on

Date of Conference:

2001