Advertisement

Journal of Intelligent Information Systems

, Volume 43, Issue 1, pp 147–182 | Cite as

Algorithms for spatial collocation pattern mining in a limited memory environment: a summary of results

  • Pawel Boinski
  • Maciej Zakrzewicz
Article

Abstract

Rapid growth of spatial datasets requires methods to find (semi-)automatically spatial knowledge from these sets. Spatial collocation patterns represent subsets of spatial features whose instances are frequently located together in a spatial neighborhood. In recent years, efficient methods for collocation discovery have been developed, however, none of them assume limited size of the operational memory or limited access to memory with short access times. Such restrictions are especially important in the context of the large size of the data structures required for efficient identification of collocation instances. In this work we present and compare three algorithms for collocation pattern mining in a limited memory environment. The first algorithm is based on the well-known joinless method introduced by Shekhar and Yoo. The second and third algorithms are inspired by a tree structure (iCPI-tree) presented by Wang et al. In our experimental evaluation, we have compared the efficiency of the algorithms, both on synthetic and real world datasets.

Keywords

Spatial collocations Limited memory Pattern mining 

Notes

Acknowledgments

Research project in this paper was supported by the Polish National Science Center (NCN), grant No. 2011/01/B/ST6/05169.

References

  1. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In Proceedings of the 20th international conference on very large data bases (pp. 487–499). San Francisco: Morgan Kaufmann Publishers Inc.Google Scholar
  2. Agrawal, R., Imieliński, T., Swami, A. (1993). Mining association rules between sets of items in large databases. SIGMOD Record, 22(2), 207–216.CrossRefGoogle Scholar
  3. Anselin, L. (1989). What is special about spatial data? Alternative perspectives on spatial data analysis (pp. 63–77). Santa Barbara.Google Scholar
  4. Chuang, K.T., & Chen, M.S. (2005). Frequent pattern discovery with memory constraint. In Proceedings of the 14th ACM international conference on information and knowledge management, CIKM ’05 (pp. 345–s346). New York: ACM.Google Scholar
  5. DeWitt, D.J., Katz, R.H., Olken, F., Shapiro, L.D., Stonebraker, M.R., Wood, D.A. (1984). Implementation techniques for main memory database systems. SIGMOD Record, 14(2), 1–8. doi: 10.1145/971697.602261.CrossRefGoogle Scholar
  6. Fayyad, U., Piatetsky-Shapiro, G., Smyth, P. (1996). From data mining to knowledge discovery in databases. AI Magazine, 17, 37–54.Google Scholar
  7. Graf, T., & Hinrichs, K. (1993). A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects In F, Dehne, JR, Sack, N, Santoro, S, Whitesides (Eds.), , Algorithms and data structures, LNCS (Vol. 709, pp. 349–360). Heidelberg: Springer.CrossRefGoogle Scholar
  8. Guttman, A. (1984). R-trees: a dynamic index structure for spatial searching. SIGMOD Record, 14(2), 47–57.CrossRefGoogle Scholar
  9. Han, J., Koperski, K., Stefanovic, N. (1997). Geominer: a system prototype for spatial data mining. SIGMOD Record, 26(2), 553–556. doi: 10.1145/253262.253404.CrossRefGoogle Scholar
  10. Huang, Y., Xiong, H., Shekhar, S., Pei, J. (2003). Mining confident co-location rules without a support threshold. In Proceedings of the 2003 ACM symposium on applied computing, SAC ’03 (pp. 497–501). New York: ACM.Google Scholar
  11. Huang, Y., Shekhar, S., Xiong, H. (2004). Discovering co-location patterns from spatial datasets: a general approach. IEEE Transactions on Knowledge and Data Engineering, 16, 472–485.CrossRefGoogle Scholar
  12. Huang, Y., Pei, J., Xiong, H. (2006). Mining co-location patterns with rare events from spatial data sets. Geoinformatica, 10(3), 239–260. doi: 10.1007/s10707-006-9827-8.CrossRefGoogle Scholar
  13. Kitsuregawa, M., Tanaka, H., Moto-Oka, T. (1983). Application of hash to data base machine and its architecture. New Generation Computer, 1(1), 63–74.CrossRefGoogle Scholar
  14. Koperski, K., & Han, J. (1995). Discovery of spatial association rules in geographic information databases. In Proceedings of the 4th international symposium on advances in spatial databases (pp. 47–66). London: Springer-Verlag.Google Scholar
  15. Koperski, K., Adhikary, J., Han, J. (1996). Spatial data mining: progress and challenges. In SIGMOD workshop on research issues on data mining and knowledge discovery (DMKD) (pp. 1–10).Google Scholar
  16. Lin, Z., & Lim, S. (2009). Optimal candidate generation in spatial co-location mining. In Proceedings of the 2009 ACM symposium on applied computing, SAC ’09 (pp. 1441–1445). New York: ACM.Google Scholar
  17. Miller, H.J., & Han, J. (2001). Geographic data mining and knowledge discovery. Bristol: Taylor & Francis, Inc.Google Scholar
  18. Morimoto, Y. (2001). Mining frequent neighboring class sets in spatial databases. In Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’01 (pp. 353–358). New York: ACM.Google Scholar
  19. Munro, R., Chawla, S, Sun, P. (2003). Complex spatial relationships. In Proceedings of the 3rd IEEE international conference on data mining (ICDM).Google Scholar
  20. Nanopoulos, A., & Manolopoulos, Y. (2004). Memory-adative association rules mining. Information Systems, 29(5), 365–384.CrossRefGoogle Scholar
  21. Prodan, R., & Fahringer, T. (2007). Grid computing: experiment management, tool integration, and scientific workflows. Berlin, Heidelberg: Springer-Verlag.Google Scholar
  22. Roddick, J.F., & Spiliopoulou, M. (1999). A bibliography of temporal, spatial and spatio-temporal data mining research. SIGKDD Exploration Newsletter, 1(1), 34–38.CrossRefGoogle Scholar
  23. Shekhar, S., & Chawla, S. (2003). Spatial databases: a tour. Prentice Hall.Google Scholar
  24. Shekhar, S., & Huang, Y. (2001). Discovering spatial co-location patterns: a summary of results In C.S. Jensen, M. Schneider, B. Seeger, V.J. Tsotras (Eds.), , SSTD (Vol. 2121, pp. 236–256). Heidelberg:LNCS Springer.Google Scholar
  25. Shekhar, S., & Huang, Y. (2002). The multi-resolution co-location miner: a new algorithm to find co-location patterns in spatial dataset. Technical Report 02-019, University of Minnesota.Google Scholar
  26. Verhein, F., & Al-Naymat, G. (2007). Fast mining of complex spatial co-location patterns using glimit.International Conference on Data Mining Workshops, 679–684.Google Scholar
  27. Wan, Y., Zhou, J., Bian, F. (2008). Codem: a novel spatial co-location and de-location patterns mining algorithm. In Proceedings of the 2008 5th international conference on fuzzy systems and knowledge discovery, FSKD ’08 (Vol. 02, pp. 576–580). Washington: IEEE Computer Society.Google Scholar
  28. Wang, L., Bao, Y., Lu, J., Yip, J. (2008). A new join-less approach for co-location pattern mining. In Q. Wu, X. He, Q.V. Nguyen, W. Jia, M.L. Huang (Eds.), CIT (pp. 197–202). Sydney: IEEE.Google Scholar
  29. Wang, L., Bao, Y., Lu, J. (2009a). Efficient discovery of spatial co-location patterns using the icpi-tree. The Open Information Systems Journal, 3(2), 69–80.CrossRefMATHGoogle Scholar
  30. Wang, L., Zhou, L., Lu, J., Yip, J. (2009b). An order-clique-based approach for mining maximal co-locations. Information Sciences, 179(19), 3370–3382. doi: 10.1016/j.ins.2009.05.023.CrossRefMATHGoogle Scholar
  31. Webb, G.I. (2000). Efficient search for association rules. In Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’00 (pp. 99–107). New York: ACM.Google Scholar
  32. Wu, X., Zhang, C., Zhang, S. (2004). Efficient mining of both positive and negative association rules. ACM Transactions on Information Systems, 22(3), 381–405. doi: 10.1145/1.010614.1010616.CrossRefGoogle Scholar
  33. Xiao, X., Xie, X., Luo, Q., Ma, W.Y. (2008). Density based co-location pattern discovery. In Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, GIS ’08 (pp. 29:1–29:10). New York: ACM.Google Scholar
  34. Yoo, J.S., & Shekhar, S. (2004). A partial join approach for mining co-location patterns. In D. Pfoser, I.F. Cruz, M. Ronthaler (Eds.), GIS (pp. 241–249). ACM.Google Scholar
  35. Yoo, J.S., Shekhar, S., Celik, M. (2005). A join-less approach for co-location pattern mining: a summary of results. In Proceedings of the IEEE international conference on data mining (pp. 813–816). Washington: IEEE Computer Society.Google Scholar
  36. Zeitouni, K. (2000). A survey on spatial data mining methods databases and statistics. In Point of views, information resources management association international conference (IRMA 2000), data warehousing and mining track.Google Scholar
  37. Zhang, X., Mamoulis, N., Cheung, D.W., Shou, Y. (2004). Fast mining of spatial collocations. In Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’04 (pp. 384–393). New York: ACM.Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Institute of Computing SciencePoznan University of TechnologyPoznanPoland

Personalised recommendations