Advertisement

GeoInformatica

, Volume 17, Issue 2, pp 387–412 | Cite as

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

  • Deepti JoshiEmail author
  • Ashok Samal
  • Leen-Kiat Soh
Article

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.

Keywords

Spatio-temporal data mining Temporal data analysis Polygonal clustering Drought analysis Trend analysis 

References

  1. 1.
    Aamodt G, Samuelsen SO, and Skrondal A (2006) A simulation study of three methods for detecting disease clusters. Int J Health Geogr, 5–15.Google Scholar
  2. 2.
    Ester M, Kriegel HP, Sander J, and Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. Second Int Conf Knowl Discov Data Min, 226–231.Google Scholar
  3. 3.
    Hwang SY, Lee CM, and Lee CH (2008) Discovering moving clusters from spatio-temporal databases. Eighth Int Conf Intell Syst Des Appl, 111–114.Google Scholar
  4. 4.
    Jeung H, Yiu XZ, Jensen C, Shen H (2008) Discovery of convoys in trajectory databases. Proc VLDB Endow 1:1068–1080Google Scholar
  5. 5.
    Jeung H, Shen HT, and Zhou X (2008) Convoy queries in spatio-temporal databases. IEEE Int Conf Data Eng, ICDE’08, 1457–1459.Google Scholar
  6. 6.
    Joshi D, Samal AK, and Soh LK (2009) Density-based clustering of polygons. IEEE Symp Ser Comput Intell Data Min, 171–178.Google Scholar
  7. 7.
    Joshi D, Samal AK, and Soh LK (2009) A dissimilarity function for clustering geospatial polygons. 17th Int Conf Adv Geogr Inform Syst (ACM SIGSPATIAL GIS 2009), 384–387.Google Scholar
  8. 8.
    Joshi D, Soh LK, Samal A, Zhang J (2011) A dissimilarity function for geospatial polygons, technical report TR-UNL-CSE-2011-0010. Department of Computer Science and Engineering, University of Nebraska, LincolnGoogle Scholar
  9. 9.
    Kalnis P, Mamoulis N and Bakiras S (2005) On discovering moving clusters in spatio-temporal data. Symp Spatial Temporal Databases, 364–381.Google Scholar
  10. 10.
    Lai C and Nguyen NT (2004) Predicting density-based spatial clusters over time. In Proc Fourth IEEE Int Conf Data Min.Google Scholar
  11. 11.
    Neill DB, Moore AW, Sabhnani MR and Daniel K (2005) Detection of emerging space-timeclusters. In Proc 11th ACM SIGKDD Intl Conf on Knowledge Discov Data Min.Google Scholar
  12. 12.
    Stolorz P et al (1995) Fast spatio-temporal data mining of large geophysical datasets. In Proc First Int Conf Data Min KDD—95, 300–305.Google Scholar
  13. 13.
    Tobler W (1970) A computer movie simulating urban growth in the Detroit region. Econ Geogr, 234–240.Google Scholar
  14. 14.
    Yoon H and Shahabi C (2009) Accurate discovery of valid convoys from moving object trajectories. IEEE Int Conf Data Min Workshops, 636–643.Google Scholar
  15. 15.
    Zhang P, Huang Y, Shekhar S and Kumar V (2003) Exploiting spatial autocorrelation to efficiently process correlation-based similarity queries. In Proc of the 8th Intl Symp on Spatial and Temporal Databases.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringUniversity of Nebraska-LincolnLincolnUSA

Personalised recommendations