Abstract
In this paper, we propose an algorithm that extracts spatial frequent patterns to explain the relative characteristics of a specific location from the available social data. This paper proposes a spatial social data model which includes spatial social data, spatial support, spatial frequent patterns, spatial partition, and spatial clustering; these concepts are used for describing the exploration algorithm of spatial frequent patterns. With these defined concepts as the foundation, an SFP-tree structure that maintains not only the frequent words but also the frequent cells was proposed, and an SFP-growth algorithm that explores the frequent patterns on the basis of this SFP-tree was proposed.
Similar content being viewed by others
References
Huberman, B., Romero, D., & Wu, F. (2008). Social networks that matter: Twitter under the microscope. First Monday, 14(1), 2008.
Kwak, H., Lee, C., Park, H., & Moon, S. (2010). What is Twitter, a social network or a news media. In Proceedings of the international conference on world wide web (WWW’10) (Vol. 19, pp. 591–600).
Sakaki, T., Okazaki, M., & Matsuo, Y. (2010). Earthquake shakes Twitter users: real-time event detection by social sensors. In Proceedings of the international conference on world wide web (WWW’10) (Vol. 19, pp. 851–860).
Andre, P., Bernstein, M., & Luther, K. (2012). Who gives a tweet?: Evaluating micro blog content value. In Proceedings of computer supported cooperative work (CSCS’12) (Vol. 15, pp. 471–474).
Kim, M. G., Kang, Y. O., & Koh, J. H. (2016). Evaluating residential location inference of twitter users at district level: Focused on Seoul city. Spatial Information Research, 24(4), 493–502.
Bao, J., Zheng, Y., & Mokbel, M. (2012). Location-based and preference-aware recommendation using sparse geo-social networking data. In Proceedings of the international conference on advances in geographic information system (SIGSPATIAL’12). (Vol. 20, pp. 199–208).
Budak, C., Agrawal, D., & El Abbadi, A. (2011). Structural trend analysis for online social networks. Proceedings of the VLDB Endowment, 4(10), 646–656.
Oxford University Press. http://blog.oup.com/2009/06/oxford-twitter/. Accessed February 20, 2017.
Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the international conference on very large databases (VLDB’94) (Vol. 20, pp. 487–499).
Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD’00) (Vol. 29, pp. 1–12).
Han, J., Cheng, H., Xin, D., & Yan, X. (2007). Frequent pattern mining: Current status and future directions. Data Mining and Knowledge Discovery, 15(1), 55–86.
Park, J., Chen, M., & Yu, P. (1995). An effective hash-based algorithm for mining association rules. In Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD’95) (Vol. 24, pp. 175–186).
Schmidt-Thieme, L. (2004). Algorithmic features of Eclat. In Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations (FIMI’04).
Brin, S., Motwani, R., Ullman, J., & Tsur, S. (1997). Dynamic itemset counting and implication rules for market basket data. In: Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD’97) (Vol. 26, pp. 255–264).
Han, J., Dong, G., Mortazavi-Asl, B., Chen, Q., Dayal, U. & Hsu, M.-C., (2000). Freespan: frequent pattern-projected sequential pattern mining. In Proceedings of the international conference of knowledge discovery and data mining (KDD’00) (vol. 6, pp. 355–359).
Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., et al. (2004). Mining sequential patterns by pattern-growth: The prefixspan approach. IEEE Transaction of Knowledge and Data Engineering., 16(11), 1424–1440.
Giannella, C., Han, J., Pei, J., Yan, X., & Yu, P. (2003). Mining frequent patterns in data streams at multiple time granularities. Next Generation Data Mining, 212, 191–212.
Mozafari, B., Thakkar, H., & Zaniolo, C. (2008). Verifying and mining frequent patterns from large windows over data streams. In Proceedings of the international conference on data engineering (ICDE’08) (Vol. 24, pp. 178–188).
Jang, H., Kim, D., Kim, J., & Jang, I. (2016). Evaluating client application status for V-World open API service. Spatial Information Research, 24(4), 367–376.19.
Acknowledgements
This research was supported by a Grant (14NSIP-B080144-01) from National Land Space Information Research Program funded by Ministry of Land, Infrastructure and Transport of Korean government.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Lee, Y., Nam, K.W. & Ryu, K.H. Fast mining of spatial frequent wordset from social database. Spat. Inf. Res. 25, 271–280 (2017). https://doi.org/10.1007/s41324-017-0094-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s41324-017-0094-6