Skip to main content

Discovery of spatial association rules in geographic information databases

  • Spatial Data Mining
  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 951))

Included in the following conference series:

Abstract

Spatial data mining, i.e., discovery of interesting, implicit knowledge in spatial databases, is an important task for understanding and use of spatial data- and knowledge-bases. In this paper, an efficient method for mining strong spatial association rules in geographic information databases is proposed and studied. A spatial association rule is a rule indicating certain association relationship among a set of spatial and possibly some nonspatial predicates. A strong rule indicates that the patterns in the rule have relatively frequent occurrences in the database and strong implication relationships. Several optimization techniques are explored, including a two-step spatial computation technique (approximate computation on large sets, and refined computations on small promising patterns), shared processing in the derivation of large predicates at multiple concept levels, etc. Our analysis shows that interesting association rules can be discovered efficiently in large spatial databases.

This research was supported in part by the research grant NSERC-OGP003723 from the Natural Sciences and Engineering Research Council of Canada and an NCE/IRIS research grant from the Networks of Centres of Excellence of Canada.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. VLDB, pp. 487–499, Santiago, Chile, Sept. 1994.

    Google Scholar 

  2. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data, pp. 207–216, Washington, D.C., May 1993.

    Google Scholar 

  3. W. G. Aref, and H. Samet. Optimization Strategies for Spatial Query Processing. In Proc. 17th Int. Conf. VLDB, Barcelona, Spain, pp. 81–90, Sept. 1991.

    Google Scholar 

  4. T. Brinkhoff, H. P. Kriegel, B. Seege. Efficient Processing of Spatial Joins Using R-trees. In Proc. 1993 ACM-SIGMOD Conf. Management of Data, Washington, D.C. pp. 237–246, May 1993.

    Google Scholar 

  5. T. Brinkhoff, H. P. Kriegel, R. Schneider, B. Seege. Multistep Processing of Spatial Joins. In Proc. 1994 ACM-SIGMOD Conf. Management of Data, Minneapolis, Minnesota, pp. 197–208, May 1994.

    Google Scholar 

  6. M. Egenhofer. Reasoning about Binary Topological Relations. In Proc. 2nd Sympp. SSD'91, Zurich, Switzerland, pp. 143–160, Aug. 1991.

    Google Scholar 

  7. M. Egenhofer. Spatial SQL: A Query and Presentation Language. In IEEE Trans. Knowledge and Data Engineering, 6:86–95, 1994.

    Google Scholar 

  8. U. Fayyad, and P. Smyth. Image Database Exploration: Progress and Challenges. In Proc. 1993 Knowledge Discovery in Databases Workshop, pp. 14–27, Washington, D.C.

    Google Scholar 

  9. U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, 1995.

    Google Scholar 

  10. S. Fotheringham, and P. Rogerson. Spatial Analysis and GIS, Taylor and Francis, 1994.

    Google Scholar 

  11. A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, Boston, MA, 1984, pp. 47–57.

    Google Scholar 

  12. J. Han, Y. Cai, and N. Gercone. Data-driven Discovery of Quantitative Rules in Relational Databases. IEEE Trans. Knowledge and Data Eng., 5:29–40, 1993.

    Google Scholar 

  13. J. Han, and Y. Fu. Discovery of Multiple-Level Association Rules from Large Databases in Proc. 1995 VLDB, Zurich, Switzerland, Sept. 1995.

    Google Scholar 

  14. W. Lu, J. Han, and B. C. Ooi. Discovery of General Knowledge in Large Spatial Databases. In Proc. Far East Workshop on Geographic Information Systems pp. 275–289, Singapore, June 1993.

    Google Scholar 

  15. R. Ng, and J. Han. Efficient and effective clustering method for spatial data mining. In Proc. 1994 Int. Conf. VLDB, pp. 144–155, Santiago, Chile, Sept. 1994

    Google Scholar 

  16. G. Piatetsky-Shapiro, and W. J. Frawley. Knowledge Discovery in Databases, AAAI/MIT Press, 1991.

    Google Scholar 

  17. G. Piatesky-Shapiro, C. J. Matheus. The Interestingness of Deviations. In Proc. 1994 Workshop on Knowledge Discovery in Databases, Seattle, WA, pp. 25–36.

    Google Scholar 

  18. F. P. Preparata, and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.

    Google Scholar 

  19. H. Samet. The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Max J. Egenhofer John R. Herring

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koperski, K., Han, J. (1995). Discovery of spatial association rules in geographic information databases. In: Egenhofer, M.J., Herring, J.R. (eds) Advances in Spatial Databases. SSD 1995. Lecture Notes in Computer Science, vol 951. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60159-7_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-60159-7_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60159-3

  • Online ISBN: 978-3-540-49536-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics