Advertisement

Change Analysis in Spatial Data by Combining Contouring Algorithms with Supervised Density Functions

  • Chun Sheng Chen
  • Vadeerat Rinsurongkawong
  • Christoph F. Eick
  • Michael D. Twa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5476)

Abstract

Detecting changes in spatial datasets is important for many fields. In this paper, we introduce a methodology for change analysis in spatial datasets that combines contouring algorithms with supervised density estimation techniques. The methodology allows users to define their own criteria for features of interest and to identify changes in those features between two datasets. Change analysis is performed by comparing interesting regions that have been derived using contour clustering. A novel clustering algorithm called DCONTOUR is introduced for this purpose that computes contour polygons that describe the boundary of a supervised density function at a given density threshold. Relationships between old and new data are analyzed relying on polygon operations. We evaluate our methodology in a case study that analyzes changes in earthquake patterns.

Keywords

Change analysis spatial data mining region discovery supervised density estimation contour clustering interestingness comparison 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asur, S., Parthasarathy, S., Ucar, D.: An Event-based Framework for Characterizing the Evolutionary Behavior of Interaction Graphs. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2007)Google Scholar
  2. 2.
    Bruss, A.R.: Extracting Topographic Features from Elevation Data using Contour Lines. Working Paper 146, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA (1977), http://hdl.handle.net/1721.1/41980
  3. 3.
    Snyder, W.V.: Algorithm 531: Contour Plotting [J6]. ACM Transactions on Mathematical Software (TOMS) (ACM) 4(3), 290–294 (1978)CrossRefGoogle Scholar
  4. 4.
    Fleder, D., Padmanabhan, B.: Cluster Evolution and Interpretation via Penalties. In: Proceedings of the 6th IEEE International Conference on Data Mining – Workshops (2006)Google Scholar
  5. 5.
    Hinneburg, A., Keim, D.A.: An Efficient Approach to Clustering in Large Multimedia Databases with Noise. In: Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (1998)Google Scholar
  6. 6.
    Jiang, D., Eick, C.F., Chen, C.-S.: On Supervised Density Estimation Techniques and Their Application to Clustering. In: Proceeding of the 15th ACM International Symposium on Advances in Geographic Information Systems (2007)Google Scholar
  7. 7.
    Spiliopoulou, M., Ntoutsi, I., Theodoridis, Y., Schult, R.: Monic – Modeling and Monitoring Cluster Transitions. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2006)Google Scholar
  8. 8.
    Watson, D.: Contouring — A Guide to the Analysis and Display of Spatial Data. In: Computer Methods in the Geosciences, vol. 10. Pergamon Press, Oxford (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Chun Sheng Chen
    • 1
  • Vadeerat Rinsurongkawong
    • 1
  • Christoph F. Eick
    • 1
  • Michael D. Twa
    • 2
  1. 1.Department of Computer ScienceUniversity of HoustonHouston
  2. 2.College of OptometryUniversity of HoustonHoustonUSA

Personalised recommendations