Region-restricted clustering for geographic data mining

  • Authors:

  • Joachim Gudmundsson;Marc van Kreveld;Giri Narasimhan

  • Affiliations:

  • NICTA,22NICTA is funded by the Australian Government as represented by the Department of Broadband, Communications and the Digital Economy and the Australian Research Council through the ICT Centr ...;Department of Information and Computing Sciences, Utrecht University, The Netherlands;School of Computing and Information Sciences, Florida International University, Miami, USA

  • Venue:
  • Computational Geometry: Theory and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Clustering problems in a complex geographical setting are often required to incorporate the type and extent of land cover within a region. Given a set P of n points in a geographical setting, with the constraint that the points of P can only occur in one type of land cover, an interesting problem is the detection of clusters. First, we extend the definition of clusters and define the concept of a region-restricted cluster that satisfies the following properties: (i) the cluster has sufficient number of points, (ii) the cluster points are confined to a small geographical area, and (iii) the amount of land cover of the specific type in which the points lie is also small. Next, we give efficient exact and approximation algorithms for computing such clusters. The exact algorithm determines all axis-parallel squares with exactly m out of n points inside, size at most some prespecified value, and area of a given land cover type at most another prespecified value, and runs in O(nmlog^2n+(nm+nn"f)log^2n"f) time, where n"f is the number of edges that bound the regions with the given land cover type. The approximation algorithm allows the square to be a factor 1+@e too large, and runs in O(nlogn+n/@e^2+n"flog^2n"f+(nlog^2n"f)/(m@e^2)) time. We also show how to compute largest clusters and outliers.