Skip to main content

OESCPM: An Online Extended Spatial Co-location Pattern Mining System

  • Conference paper
  • First Online:
Web and Big Data (APWeb-WAIM 2022)

Abstract

In spatial data mining, co-location pattern mining is intended to discover the sets of spatial features whose instances occur frequently in nearby geographic areas. Co-location pattern mining is an important task in spatial data mining and has been applied in many applications. Although many spatial co-location pattern mining methods applied to point objects have been proposed, few mining approaches are designed for extended spatial objects in practical scenes. Unlike existing works, we develop OESCPM (Online Extended Spatial Co-location Pattern Mining System) to mine co-location patterns over extended objects. OESCPM decomposes extended instances into cells and counts the number of cells belonging to different features. With simple interaction on OESCPM, users can view co-location patterns over interested extended spatial datasets online.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Wang, L., Bao, X., Zhou, L.: Redundancy reduction for prevalent co-location patterns. IEEE Trans. Knowl. Data Eng. 30(1), 142–155 (2017). https://doi.org/10.1109/TKDE.2017.2759110

    Article  Google Scholar 

  2. Tran, V., Wang, L., Chen, H., Xiao, Q.: MCHT: a maximal clique and hash table-based maximal prevalent co-location pattern mining algorithm. Expert Syst. Appl. 175, 114830 (2021). https://doi.org/10.1016/j.eswa.2021.114830

    Article  Google Scholar 

  3. Wang, L., Zhou, L., Lu, J., Yip, J.: An order-clique-based approach for mining maximal co-locations. Inf. Sci. 179, 3370–3382 (2009). https://doi.org/10.1016/j.ins.2009.05.023

    Article  MATH  Google Scholar 

  4. Fang, Y., Wang, L., Hu, T., Wang, X.: DFCPM: a dominant feature co-location pattern miner. In: Cai, Y., Ishikawa, Y., Xu, J. (eds.) APWeb-WAIM 2018. LNCS, vol. 10987, pp. 456–460. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96890-2_38

    Chapter  Google Scholar 

  5. National Earth System Science Data Center. National Science & Technology Infrastructure of China. http://www.geodata.cn

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (61966036); Yunnan Fundamental Research Projects (202201AS070015); and the Project of Innovative Research Team of Yunnan Province (2018HC019). We also acknowledge for the data support from “National Earth System Science Data Center, National Science & Technology Infrastructure of China” (http://www.geodata.cn). National Natural Science Foundation of China, 62276227.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lizhen Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, J., Wang, L., Lou, W., Tran, V. (2023). OESCPM: An Online Extended Spatial Co-location Pattern Mining System. In: Li, B., Yue, L., Tao, C., Han, X., Calvanese, D., Amagasa, T. (eds) Web and Big Data. APWeb-WAIM 2022. Lecture Notes in Computer Science, vol 13423. Springer, Cham. https://doi.org/10.1007/978-3-031-25201-3_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-25201-3_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-25200-6

  • Online ISBN: 978-3-031-25201-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics