Spatio-temporal polygonal clustering with space and time as first-class citizens

  • Authors:
  • Deepti Joshi;Ashok Samal;Leen-Kiat Soh

  • Affiliations:
  • Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, USA 68588-0115;Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, USA 68588-0115;Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, USA 68588-0115

  • Venue:
  • Geoinformatica
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Detecting spatio-temporal clusters, i.e. clusters of objects similar to each other occurring together across space and time, has important real-world applications such as climate change, drought analysis, detection of outbreak of epidemics (e.g. bird flu), bioterrorist attacks (e.g. anthrax release), and detection of increased military activity. Research in spatio-temporal clustering has focused on grouping individual objects with similar trajectories, detecting moving clusters, or discovering convoys of objects. However, most of these solutions are based on using a piece-meal approach where snapshot clusters are formed at each time stamp and then the series of snapshot clusters are analyzed to discover moving clusters. This approach has two fundamental limitations. First, it is point-based and is not readily applicable to polygonal datasets. Second, its static analysis approach at each time slice is susceptible to inaccurate tracking of dynamic cluster especially when clusters change over both time and space. In this paper we present a spatio-temporal polygonal clustering algorithm known as the Spatio-Temporal Polygonal Clustering (STPC) algorithm. STPC clusters spatial polygons taking into account their spatial and topological properties, treating time as a first-class citizen, and integrating density-based clustering with moving cluster analysis. Our experiments on the drought analysis application, flu spread analysis and crime cluster detection show the validity and robustness of our algorithm in an important geospatial application.