RCP Mining: Towards the Summarization of Spatial Co-location Patterns

  • Bozhong LiuEmail author
  • Ling Chen
  • Chunyang Liu
  • Chengqi Zhang
  • Weidong Qiu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9239)


Co-location pattern mining is an important task in spatial data mining. However, the traditional framework of co-location pattern mining produces an exponential number of patterns because of the downward closure property, which makes it hard for users to understand, or apply. To address this issue, in this paper, we study the problem of mining representative co-location patterns (RCP). We first define a covering relationship between two co-location patterns by finding a new measure to appropriately quantify the distance between patterns in terms of their prevalence, based on which the problem of RCP mining is formally formulated. To solve the problem of RCP mining, we first propose an algorithm called RCPFast, adopting the post-mining framework that is commonly used by existing distance-based pattern summarization techniques. To address the peculiar challenge in spatial data mining, we further propose another algorithm, RCPMS, which employs the mine-and-summarize framework that pushes pattern summarization into the co-location mining process. Optimization strategies are also designed to further improve the performance of RCPMS. Our experimental results on both synthetic and real-world data sets demonstrate that RCP mining effectively summarizes spatial co-location patterns, and RCPMS is more efficient than RCPFast, especially on dense data sets.


Approximation Strategy Frequent Itemset Compression Rate Representative Pattern Cover Relationship 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



We thank the anonymous reviewers for their detailed suggestions for improving the paper. This work was supported, in part, by the Australian Research Council (ARC) Discovery Project under Grant No. DP140100545.


  1. 1.
    Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, p. 74. Springer, Heidelberg (2002) CrossRefGoogle Scholar
  2. 2.
    Chen, L., Liu, C., Zhang, C.: Mining Probabilistic Representative Frequent Patterns From Uncertain Data. In: SDM, pp. 73–81 (2013)Google Scholar
  3. 3.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  4. 4.
    Huang, Y., Pei, J., Xiong, H.: Mining co-location patterns with rare events from spatial data sets. GeoInformatica 10(3), 239–260 (2006)CrossRefGoogle Scholar
  5. 5.
    Huang, Y., Shekhar, S., Xiong, H.: Discovering colocation patterns from spatial data sets: a general approach. IEEE Trans. Knowl. Data Eng. 16(12), 1472–1485 (2004)CrossRefGoogle Scholar
  6. 6.
    Bayardo, Jr., R.J.: Efficiently mining long patterns from databases. In: SIGMOD Conference, pp. 85–93 (1998)Google Scholar
  7. 7.
    Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On trip planning queries in spatial databases. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273–290. Springer, Heidelberg (2005) CrossRefGoogle Scholar
  8. 8.
    Liu, B., Chen, L., Liu, C., Zhang, C., Qiu, W.: RCP Mining: Towards the Summarization of Spatial Co-location Patterns.
  9. 9.
    Liu, C., Chen, L., Zhang, C.: Summarizing probabilistic frequent patterns: a fast approach. In: SIGKDD, pp. 527–535 (2013)Google Scholar
  10. 10.
    Liu, G., Zhang, H., Wong, L.: Finding minimum representative pattern sets. In: KDD, pp. 51–59 (2012)Google Scholar
  11. 11.
    Modani, N., Dey, K.: Large maximal cliques enumeration in sparse graphs. In: CIKM, pp. 1377–1378 (2008)Google Scholar
  12. 12.
    Morimoto, Y.: Mining frequent neighboring class sets in spatial databases. In: KDD, pp. 353–358 (2001)Google Scholar
  13. 13.
    Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398–416. Springer, Heidelberg (1998) CrossRefGoogle Scholar
  14. 14.
    Shekhar, S., Huang, Y.: Discovering spatial co-location patterns: a summary of results. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 236–256. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  15. 15.
    Wang, L., Zhou, L., Lu, J., Yip, J.: An order-clique-based approach for mining maximal co-locations. Inf. Sci. 179(19), 3370–3382 (2009)zbMATHCrossRefGoogle Scholar
  16. 16.
    Wang, S., Huang, Y., Wang, X.S.: Regional co-locations of arbitrary shapes. In: Nascimento, M.A., Sellis, T., Cheng, R., Sander, J., Zheng, Y., Kriegel, H.-P., Renz, M., Sengstock, C. (eds.) SSTD 2013. LNCS, vol. 8098, pp. 19–37. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  17. 17.
    Xin, D., Han, J., Yan, X., Cheng, H.: Mining compressed frequent-pattern sets. In: VLDB, pp. 709–720 (2005)Google Scholar
  18. 18.
    Yan, X., Cheng, H., Han, J., Xin, D.: Summarizing itemset patterns: a profile-based approach. In: KDD, pp. 314–323 (2005)Google Scholar
  19. 19.
    Yoo, J.S., Bow, M.: Mining Top-k closed co-location patterns. In: ICSDM, pp. 100–105 (2011)Google Scholar
  20. 20.
    Yoo, J.S., Shekhar, S.: A partial join approach for mining co-location patterns. In: GIS, pp. 241–249 (2004)Google Scholar
  21. 21.
    Yoo, J.S., Shekhar, S.: A joinless approach for mining spatial colocation patterns. IEEE Trans. Knowl. Data Eng. 18(10), 1323–1337 (2006)CrossRefGoogle Scholar
  22. 22.
    Zhang, X., Mamoulis, N., Cheung, D.W., Shou, Y.: Fast mining of spatial collocations. In: KDD, pp. 384–393 (2004)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Bozhong Liu
    • 1
    • 2
    Email author
  • Ling Chen
    • 2
  • Chunyang Liu
    • 2
  • Chengqi Zhang
    • 2
  • Weidong Qiu
    • 1
  1. 1.School of Information Security and EngineeringShanghai Jiao Tong UniversityShanghaiChina
  2. 2.Centre for Quantum Computation and Intelligent SystemsUniversity of TechnologySydneyAustralia

Personalised recommendations