Skip to main content
Log in

A spatial co-location pattern mining framework insensitive to prevalence thresholds based on overlapping cliques

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Discovering spatial co-location patterns is a process of finding groups of distinct spatial features whose instances are frequently located together in spatial proximity. A co-location pattern is prevalent if its participation index is no less than a minimum prevalence threshold given by users. Most of the existing algorithms are very sensitive to the prevalence threshold, when users change the prevalence threshold, these algorithms have to re-collect table instances and re-calculate participation indexes of all patterns for mining the prevalent patterns that users expect to acquire. To tackle this issue, we propose an overlapping clique-based spatial co-location pattern mining framework (OCSCP). In our framework, we design a two-level filter mechanism with the first level is a feature type filter and the second level is a neighboring instance filter. By employing the mechanism, under a certain neighbor relationship, spatial instances are divided into a set of overlapping cliques and each clique is also a co-location instance of a pattern. And then, a co-location pattern hash map structure is designed to store table instances of patterns based on these overlapping cliques. The participation index of each pattern can be fast and directly calculated from the hash map structure. Thus, when the prevalence threshold is changed, the proposed framework does not need to re-gather table instances, and the mining result can be adaptively and quickly given to users. The proposed algorithms are performed on both synthetic and real-world data sets to demonstrate that our algorithms can rapidly respond to user requirements compared to the previous algorithms.

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

Access this article

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

Instant access to the full article PDF.

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
Fig. 14
Fig. 15

Similar content being viewed by others

Notes

  1. https://figshare.com/articles/dataset/OCSCP/12941714

  2. https://www.cs.utah.edu/~lifeifei/SpatialDataset.htm

  3. https://www.pocketgpsworld.com/

References

  1. Akbari, M., Samadzadegan, F., Weibel, R.: A generic regional spatio-temporal co-occurrence pattern mining model: a case study for air pollution. Journal of Geographical Systems 17(3), 249–274 (2015). https://doi.org/10.1007/s10109-015-0216-4

    Article  Google Scholar 

  2. Al-Naymat, G.: Enumeration of maximal clique for mining spatial co-location patterns. In: 2008 IEEE/ACS International Conference on Computer Systems and Applications, IEEE, pp 126–133 (2008)

  3. An, S., Yang, H., Wang, J., Cui, N., Cui, J.: Mining urban recurrent congestion evolution patterns from gps-equipped vehicle mobility data. Information Sciences 373, 515–526 (2016)

    Article  Google Scholar 

  4. Andrzejewski, W., Boinski, P.: Efficient spatial co-location pattern mining on multiple gpus. Expert Systems with Applications 93, 465–483 (2018)

    Article  Google Scholar 

  5. Boinski, P., Zakrzewicz, M.: Algorithms for spatial collocation pattern mining in a limited memory environment: a summary of results. Journal of Intelligent Information Systems 43(1), 147–182 (2014)

    Article  Google Scholar 

  6. Chang, X., Ma, Z., Lin, M., Yang, Y., Hauptmann, A.G.: Feature interaction augmented sparse learning for fast kinect motion detection. IEEE transactions on image processing 26(8), 3911–3920 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1240–1248 (2012)

  8. Huang, Y., Pei, J., Xiong, H.: Mining co-location patterns with rare events from spatial data sets. Geoinformatica 10(3), 239–260 (2006)

    Article  Google Scholar 

  9. Kim, S.K., Kim, Y., Kim, U.: Maximal cliques generating algorithm for spatial co-location pattern mining. In: FTRA International Conference on Secure and Trust Computing, Data Management, and Application, Springer, pp 241–250 (2011)

  10. Leibovici, D.G., Claramunt, C., Le Guyader, D., Brosset, D.: Local and global spatio-temporal entropy indices based on distance-ratios and co-occurrences distributions. International Journal of Geographical Information Science 28(5), 1061–1084 (2014)

    Article  Google Scholar 

  11. Li, J., Zhang, W., Yu, J., Chen, H.: Industrial spatial agglomeration using distance-based approach in beijing, china. Chinese Geographical Science 25(6), 698–712 (2015)

    Article  Google Scholar 

  12. Li, J., Adilmagambetov, A., Jabbar, M.S.M., Zaïane, O.R., Osornio-Vargas, A., Wine, O.: On discovering co-location patterns in datasets: a case study of pollutants and child cancers. GeoInformatica 20(4), 651–692 (2016)

    Article  Google Scholar 

  13. Ouyang, Z., Wang, L., Wu, P.: Spatial co-location pattern discovery from fuzzy objects. International Journal on Artificial Intelligence Tools 26(02), 1750003 (2017)

    Article  Google Scholar 

  14. Qian, F., He, Q., Chiew, K., He, J.: Spatial co-location pattern discovery without thresholds. Knowledge and Information Systems 33(2), 419–445 (2012)

    Article  Google Scholar 

  15. Sainju, A.M., Aghajarian, D., Jiang, Z., Prasad, S.K.: Parallel grid-based colocation mining algorithms on gpus for big spatial event data. IEEE Transactions on Big Data (2018)

  16. Shekhar, S., Huang, Y.: Discovering spatial co-location patterns: A summary of results. In: International symposium on spatial and temporal databases, Springer, pp 236–256 (2001)

  17. Sierra, R., Stephens, C.R.: Exploratory analysis of the interrelations between co-located boolean spatial features using network graphs. International Journal of Geographical Information Science 26(3), 441–468 (2012)

    Article  Google Scholar 

  18. Tran, V., Wang, L., Zhou, L.: Mining spatial co-location patterns based on overlap maximal clique partitioning. In: 2019 20th IEEE International Conference on Mobile Data Management (MDM), IEEE, pp 467–472 (2019)

  19. Verhein, F., Al-Naymat, G.: Fast mining of complex spatial co-location patterns using glimit. In: Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007), IEEE, pp 679–684 (2007)

  20. Wang, L., Bao, Y., Lu, J., Yip, J.: A new join-less approach for co-location pattern mining. In: 2008 8th IEEE International Conference on Computer and Information Technology, IEEE, pp 197–202 (2008)

  21. Wang, L., Bao, Y., Lu, Z.: Efficient discovery of spatial co-location patterns using the icpi-tree. The Open Information Systems Journal 3(1), (2009)

  22. Wang, L., Zhou, L., Lu, J., Yip, J.: An order-clique-based approach for mining maximal co-locations. Information Sciences 179(19), 3370–3382 (2009)

    Article  MATH  Google Scholar 

  23. Wang, L., Chen, H., Zhao, L., Zhou, L.: Efficiently mining co-location rules on interval data. In: International Conference on Advanced Data Mining and Applications, Springer, pp 477–488 (2010)

  24. Wang, L., Wu, P., Chen, H.: Finding probabilistic prevalent colocations in spatially uncertain data sets. IEEE Transactions on Knowledge and Data Engineering 25(4), 790–804 (2011)

    Article  Google Scholar 

  25. Wang, L., Bao, X., Zhou, L.: Redundancy reduction for prevalent co-location patterns. IEEE Transactions on Knowledge and Data Engineering 30(1), 142–155 (2017)

    Article  Google Scholar 

  26. Wang, L., Bao, X., Chen, H., Cao, L.: Effective lossless condensed representation and discovery of spatial co-location patterns. Information Sciences 436, 197–213 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  27. Yao, X., Peng, L., Yang, L., Chi, T.: A fast space-saving algorithm for maximal co-location pattern mining. Expert Systems with Applications 63, 310–323 (2016)

    Article  Google Scholar 

  28. Yoo, J.S., Bow, M.: Mining top-k closed co-location patterns. In: Proceedings 2011 IEEE International Conference on Spatial Data Mining and Geographical Knowledge Services, IEEE, pp 100–105 (2011)

  29. Yoo, J.S., Bow, M.: A framework for generating condensed co-location sets from spatial databases. Intelligent Data Analysis 23(2), 333–355 (2019)

    Article  Google Scholar 

  30. Yoo, J.S., Shekhar, S.: A joinless approach for mining spatial colocation patterns. IEEE Transactions on Knowledge and Data Engineering 18(10), 1323–1337 (2006)

    Article  Google Scholar 

  31. Yoo, J.S., Shekhar, S., Smith, J., Kumquat, J.P.: A partial join approach for mining co-location patterns. In: Proceedings of the 12th annual ACM international workshop on Geographic information systems, pp 241–249 (2004)

  32. Yu, W.: Spatial co-location pattern mining for location-based services in road networks. Expert Systems with Applications 46, 324–335 (2016)

    Article  Google Scholar 

  33. Zaki, M.J., Ogihara, M.: Theoretical foundations of association rules. In: 3rd ACM SIGMOD workshop, pp 71–78 (1998)

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (61966036, 61662086) and the Project of Innovative Research Team of Yunnan Province(2018HC019).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lizhen Wang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tran, V., Wang, L. & Zhou, L. A spatial co-location pattern mining framework insensitive to prevalence thresholds based on overlapping cliques. Distrib Parallel Databases 41, 511–548 (2023). https://doi.org/10.1007/s10619-021-07333-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10619-021-07333-2

Keywords

Navigation