Spatial Co-location Pattern Mining Using Delaunay Triangulation

  • G. Kiran Kumar
  • Ilaiah Kavati
  • Koppula Srinivas Rao
  • Ramalingaswamy Cheruku
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 705)


Spatial data mining is the process of finding interesting patterns that may implicitly exist in spatial database. The process of finding the subsets of features that are frequently found together in a same location is called co-location pattern discovery. Earlier methods to find co-location patterns focuses on converting neighbourhood relations to item sets. Once item sets are obtained then can apply any method for finding patterns. The criteria to know the strength of co-location patterns is participation ratio and participation index. In this paper, Delaunay triangulation approach is proposed for mining co-location patterns. Delaunay triangulation represents the closest neighbourhood structure of the features exactly which is a major concern in finding the co-location patterns. The results show that this approach achieves good performance when compared to earlier methodologies.


Delaunay triangulation Co-location patterns Participation ratio Participation index Max PI Medoid PI 


  1. 1.
    Gordon, A.D.: Hierarchical classification. In: Clustering and Classification, pp. 65–121. World Scientific (1996)Google Scholar
  2. 2.
    Kavati, I., Chenna, V., Prasad, M.V., Bhagvati, C.: Classification of extended Delaunay triangulation for fingerprint indexing. In: 2014 8th Asia Modelling Symposium (AMS), pp. 153–158. IEEE (2014)Google Scholar
  3. 3.
    Kavati, I., Prasad, M.V., Bhagvati, C.: Vein pattern indexing using texture and hierarchical decomposition of Delaunay triangulation. In: International Symposium on Security in Computing and Communication, pp. 213–222. Springer (2013)Google Scholar
  4. 4.
    Kavati, I., Prasad, M.V., Bhagvati, C.: Hierarchical decomposition of extended triangulation for fingerprint indexing. In: Efficient Biometric Indexing and Retrieval Techniques for Large-Scale Systems, pp. 21–40. Springer (2017)Google Scholar
  5. 5.
    Kumar, G.K., Premchand, P., Gopal, T.V.: Mining of spatial co-location pattern from spatial datasets. Int. J. Comput. Appl. 42(21), 25–30 (2012)Google Scholar
  6. 6.
    Mennis, J., Guo, D.: Spatial data mining and geographic knowledge discoveryan introduction. Comput. Environ. Urban Syst. 33(6), 403–408 (2009)CrossRefGoogle Scholar
  7. 7.
    Morimoto, Y.: Mining frequent neighboring class sets in spatial databases. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 353–358. ACM (2001)Google Scholar
  8. 8.
    Pech Palacio, M.A.: Spatial data modeling and mining using a graph-based representation. Ph.D. Thesis, Villeurbanne, INSA (2005)Google Scholar
  9. 9.
    Shekhar, S., Huang, Y.: Processing advanced queries-discovering spatial co-location patterns: a summary of results. Lect. Notes Comput. Sci. 2121, 236–256 (2001)CrossRefGoogle Scholar
  10. 10.
    Van Canh, T., Gertz, M.: A constraint neighborhood based approach for co-location pattern mining. In: 2012 Fourth International Conference on Knowledge and Systems Engineering (KSE), pp. 128–135. IEEE (2012)Google Scholar
  11. 11.
    Yoo, J.S., Boulware, D., Kimmey, D.: A parallel spatial co-location mining algorithm based on mapreduce. In: 2014 IEEE International Congress on Big Data (BigData Congress), pp. 25–31. IEEE (2014)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • G. Kiran Kumar
    • 1
  • Ilaiah Kavati
    • 2
  • Koppula Srinivas Rao
    • 1
  • Ramalingaswamy Cheruku
    • 3
  1. 1.Department of CSEMLR Institute of TechnologyHyderabadIndia
  2. 2.Department of CSEAnurag Group of InstitutionsHyderabadIndia
  3. 3.Department of Computer Science and EngineeringNational Institute of Technology GoaPondaIndia

Personalised recommendations