Skip to main content
SpringerLink
Log in

FARICS: a method of mining spatial association rules and collocations using clustering and Delaunay diagrams

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

The paper presents problems pertaining to spatial data mining. Based on the existing solutions a new method of knowledge extraction in the form of spatial association rules and collocations has been worked out and is proposed herein. Delaunay diagram is used for determining neighborhoods. Based on the neighborhood notion, spatial association rules and collocations are defined. A novel algorithm for finding spatial rules and collocations has been presented. The approach allows eliminating the parameters defining neighborhood of objects, thus avoiding multiple “test and trial” repetitions of the process of mining for various parameter values. The presented method has been implemented and tested. The results of the experiments have been discussed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  • Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In Proc. 20th int. conf. very large data bases (VLDB’94) (pp. 478–499).

  • Bembenik, R. (2007). Methods of mining data from spatial information systems. Ph.D. thesis, Warsaw University of Technology (in Polish).

  • Bembenik, R., & Protaziuk, G. (2004). Mining spatial association rules. In Proc. of IIS:IIP WM’04 (pp. 3–12). Zakopane, Poland: Springer Verlag.

    Google Scholar 

  • de Bert, M., Schwarzkopf, O., von Kreveld, M., & Overmars, M. (2000). Computational geometry: Algorithms and applications. Heidelberg: Springer.

    Google Scholar 

  • Ester, M., Kriegel, H. P., & Sander, J. (1997). Spatial data mining: A database approach. In Proc. of the 5th int. symposium on large spatial databases (SSD’97). Berlin: Lecture Notes in Computer Science.

  • Ester, M., Frommelt, A., Kriegel, H.-P., & Sander, J. (1998). Algorithms for characterization and trend detection in spatial databases. In Proceedings of 4th international conference on knowledge discovery and data mining. New York.

  • Ester, M., Frommelt, A., Kriegel, H.-P., & Sander, J. (2000). Spatial data mining: database primitives, algorithms and efficient DBMS support. Data Mining and Knowledge Discovery, 4, 193–216.

    Article  Google Scholar 

  • Ester, M., Kriegel, H. P., & Sander, J. (1999). Knowledge discovery in spatial databases, 23rd German Conf. on Artificial Intelligence (KI’99). Bonn.

  • Ester, M., Kriegel, H.-P., & Sander, J. (2001). Algorithms and applications for spatial data mining, geographic data mining and knowledge discovery, research monographs in GIS. London: Taylor and Francis.

    Google Scholar 

  • Estivill-Castro, V., & Lee, I. (2000a). AMOEBA: Hierarchical clustering based on spatial proximity using Delaunay diagram. In Proceedings of the 9th international symposium on spatial data Handling.

  • Estivill-Castro, V., & Lee, I. (2000b). AUTOCLUST: automatic clustering via boundary extraction for mining massive point-data sets. In Proceedings of the 5th international conference on geocomputation.

  • Estivill-Castro, V., & Lee, I. (2001). Data mining techniques for autonomous exploration of large volumes of geo-referenced crime data. In Proc. of the 6th international conference on geocomputation.

  • Han, J., Koperski, K., & Stefanovic, N. (1997). GeoMiner: A system prototype for spatial data mining. In Proc. ACM SIGMOD intl. conf. on management of data.

  • Huang, Y., Shekhar, S., & Xiong, H. (2002). Discovering co-location patterns from spatial datasets: A general approach. University of Minnesota Technical Report.

  • Kang, I., Kim, T., & Li, K. (1997). A spatial data mining method by Delaunay triangulation. In Proceedings of the 5th international workshop on advances in geographic information systems (GIS-97).

  • Koperski, K., & Han, J. (1995). Discovery of spatial association rules in geographic information databases. In Proceedings of 4th international symposium on large spatial databases.

  • Koperski, K., Han, J., & Stefanovic, N. (1998). An efficient two-step method for classification of spatial data. In Proc. int. symp. on spatial data handling (SDH ‘98).

  • Kryszkiewicz, M., & Skonieczny, Ł. (2005). Faster clustering with DBSCAN. Intelligent information systems. Gdańsk: Springer.

    Google Scholar 

  • Miller, H. J. (2006). Geographic data mining and knowledge discovery. In J. P. Wilson & A. S. Fotheringham (Eds.), Handbook of geographic information science. Malden, MA: Blackwell.

    Google Scholar 

  • Mitchell, J. (2005). Notes on Voronoi and Delaunay diagrams. Course materials. State University of New York at Stony Brook.

  • Morimoto, Y. (2001). Mining frequent neighboring class sets in spatial databases. KDD’01. San Francisco.

  • Ng, R. T., & Han, J. (1994). Efficient and effective clustering methods for spatial data mining. In Proc. 20th int. conf. on very large data bases (pp. 144–155). Santiago: Kaufmann.

    Google Scholar 

  • Openshaw, S. (1999). Geographical data mining: key design issues. In Proceedings of the 4th international conference on geocomputation.

  • Preparata, F. P., & Shamos, M. I. (1985). Computational geometry. Berlin: Springer.

    Google Scholar 

  • Shekhar, S., & Chawla, S. (2003). Spatial databases: A tour. Upper saddle. NJ: Prentice Hall.

    Google Scholar 

  • Shekhar, S., & Huang, Y. (2001). Discovering spatial co-location patterns: A summary of results. In Proc of SSTD. Redondo Beach.

  • Wang, W., Yang, J., & Munz, R. (1997). STING: A statistical information grid approach to spatial data mining. In Proc. 23rd int. conf. on very large data bases (pp. 186–195). Athens: Kaufmann.

    Google Scholar 

  • Yoo, J., & Shekhar, S. (2004). A partial join approach for minng co-location patterns. In Proc. of ACM intn’l symposium on advances in geographic information systems (ACM–GIS).

  • Yoo, J. S., Shekhar, S., & Celik, M. (2005). A join-less approach for co-location pattern mining: A summary of results. In Proc. of the IEEE international conference on data mining (ICDM). Houston.

  • Zhang, T., Ramakrishnan, R., & Linvy, M. (1996). BIRCH: An efficient data clustering method for very large databases. In Proc. ACM SIGMOD int. conf. on management of data (pp. 103–114). ACM Press.

  • Zhang, X., Mamoulis, N., Cheung, D. W., & Shou, Y. (2004). Fast mining of spatial collocations. KDD.

Download references

Acknowledgements

The research has been partially supported by grant no. 3 T11C 002 29 received from Polish Ministry of Education and Science. We would like to thank two anonymous referees for their comments that helped us in improving the quality of the paper.

Author information

Authors and Affiliations

  1. Institute of Computer Science, Warsaw University of Technology, Warsaw, Poland

    Robert Bembenik & Henryk Rybiński

Authors
  1. Robert Bembenik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henryk Rybiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Henryk Rybiński.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bembenik, R., Rybiński, H. FARICS: a method of mining spatial association rules and collocations using clustering and Delaunay diagrams. J Intell Inf Syst 33, 41–64 (2009). https://doi.org/10.1007/s10844-008-0076-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10844-008-0076-1

Keywords

Search

Navigation