Skip to main content

OICPM: An Interactive System to Find Interesting Co-location Patterns Using Ontologies

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

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10367))

Abstract

In spatial data mining, the usefulness of co-location patterns is strongly limited by the huge amount of delivered co-location patterns. Although many methods have been proposed to reduce the number of co-location patterns, most of them do not guarantee that the extracted co-location patterns are interesting for the user for being generally based on statistical information. This demonstration presents OICPM, an interactive system to discover interesting co-location patterns based on ontologies. With OICPM, the user can find his/her real interesting ones from a massive amount of co-location patterns efficiently within only a few rounds of selection, and the mined interesting co-location patterns are filtered in order for better decision.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Huang, Y., Shekhar, S., Xiong, H.: Discovering co-location patterns from spatial data sets: a general approach. IEEE Trans. Knowl. Data Eng. (TKDE) 16(12), 1472–1485 (2004)

    Article  Google Scholar 

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

    Google Scholar 

  3. Wang, L., Zhou, L., Lu, J., et al.: An order-clique-based approach for mining maximal co-locations. Inf. Sci. 179(2009), 3370–3382 (2009)

    Article  MATH  Google Scholar 

  4. Xin, D., Shen, X., Mei, Q., et al.: Discovering interesting patterns through user’s interactive feedback. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 773–778 (2006)

    Google Scholar 

  5. Bao, X., Wang, L., Wang, M.: OICRM: an ontology-based interesting co-location rule miner. In: Asian Pacific Web Conference, pp. 570–573 (2016)

    Google Scholar 

  6. Bao, X., Wang, L., Chen, H.: Ontology-based interactive post-mining of interesting co-location patterns. In: Asian Pacific Web Conference, pp. 406–409 (2016)

    Google Scholar 

Download references

Acknowledgements

This work was supported in part by grants (No. 61472346, No. 61662086) from the National Natural Science Foundation of China, by grants (No. 2016FA026, No .2015FB114) from the Science Foundation of Yunnan Province and by the Spectrum Sensing and borderlands Security Key Laboratory of Universities in Yunnan (C6165903).

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

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Bao, X., Wang, L., Xiao, Q. (2017). OICPM: An Interactive System to Find Interesting Co-location Patterns Using Ontologies. In: Chen, L., Jensen, C., Shahabi, C., Yang, X., Lian, X. (eds) Web and Big Data. APWeb-WAIM 2017. Lecture Notes in Computer Science(), vol 10367. Springer, Cham. https://doi.org/10.1007/978-3-319-63564-4_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63564-4_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-63563-7

  • Online ISBN: 978-3-319-63564-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics