This Article 
 Bibliographic References 
 Add to: 
A Joinless Approach for Mining Spatial Colocation Patterns
October 2006 (vol. 18 no. 10)
pp. 1323-1337
Spatial colocations represent the subsets of features which are frequently located together in geographic space. Colocation pattern discovery presents challenges since spatial objects are embedded in a continuous space, whereas classical data is often discrete. A large fraction of the computation time is devoted to identifying the instances of colocation patterns. We propose a novel joinless approach for efficient colocation pattern mining. The joinless colocation mining algorithm uses an instance-lookup scheme instead of an expensive spatial or an instance join operation for identifying colocation instances. We prove the joinless algorithm is correct and complete in finding colocation rules. We also describe a partial join approach for a spatial data set often clustered in neighborhood areas. We provide the algebraic cost models to characterize the performance dominance zones of the joinless method and the partial join method with a current join-based colocation mining method, and compare their computational complexities. In the experimental evaluation, using synthetic and real-world data sets, our methods performed more efficiently than the join-based method and show more scalability in dense data.

[1] J. Roddick and M. Spiliopoulou, “A Bibliography of Temporal, Spatial and Spatio-Temporal Data Mining Research,” Proc. SIGKDD Explorations, vol. 1, no. 1, pp. 34-38, 1999.
[2] S. Shekhar and S. Chawla, Spatial Databases: A Tour. Prentice Hall, 2003.
[3] S. Shekhar, P. Zhang, Y. Huang, and R. Vatsavai, “Trends in Spatial Data Mining,” Data Mining: Next Generation Challenges and Future Directions, AAAI/MIT Press, 2004.
[4] “Nsf-Sei Project: Spatio-Temporal Analysis for Ecology Behavior,”, 2006.
[5] R. Agarwal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 20th Conf. Very Large Databases, 1994.
[6] K. Koperski and J. Han, “Discovery of Spatial Association Rules in Geographic Information Databases,” Proc. Fourth Int'l Symp. Large Spatial Data Bases, pp. 47-66, 1995.
[7] S. Shekhar and Y. Huang, “Colocation Rules Mining: A Summary of Results,” Proc. Int'l Symp. Spatio and Temporal Database (SSTD), 2001.
[8] Y. Morimoto, “Mining Frequent Neighboring Class Sets in Spatial Databases,” Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, 2001.
[9] D. Papadias, N. Mamoulis, and Y. Theodoridis, “Processing and Optimization of Multiway Spatial Joins Using R-Trees,” Proc. Symp. Principles of Database Systems, 1999.
[10] H. Park, G. Cha, and C. Chung, “Multi-Way Spatial Joins Using R-Trees: Methodology and Performance Evaluation,” Proc. Sixth Int'l Symp. Advances in Spatial Databases, 1999.
[11] J. Yoo and S. Shekhar, “A Partial Join Approach for Mining Colocation Patterns,” Proc. ACM Int'l Symp. Advances in Geographic Information Systems (ACM-GIS), 2004.
[12] M. Kuramochi and G. Karypis, “Frequent Subgraph Discovery,” Proc. IEEE Int'l Conf. Data Mining, 2001.
[13] X. Yan and J. Han, “gSpan: Graph-Based Substructure Pattern Mining,” Proc. IEEE Int'l Conf. Data Mining, 2001.
[14] J. Yoo and S. Shekhar, “A Join-Less Approach for Co-Location Pattern Mining: A Summary of Results,” Proc. IEEE Int'l Conf. Data Mining (ICDM), 2005.
[15] L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. Vitter, “Scalable Sweeping-Based Spatial Join,” Proc. Int'l Conf. Very Large Databases, 1998.
[16] “Discovery of Patterns in the Global Climate System Using Data Mining,” http://www.ahpcrc.umn.edunasa-umn/, 2006.

Index Terms:
Spatial data mining, association rule, colocation pattern, spatial neighbor relationship.
Jin Soung Yoo, Shashi Shekhar, "A Joinless Approach for Mining Spatial Colocation Patterns," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 10, pp. 1323-1337, Oct. 2006, doi:10.1109/TKDE.2006.150
Usage of this product signifies your acceptance of the Terms of Use.