Abstract
A co-location pattern is a set of spatial features whose instances frequently appear in a spatial neighborhood. The data from which the patterns are derived is often historic, yet little or no attention has been paid to the time aspects of this data. In this paper we study the problem of finding prevalent co-location patterns from time constrained spatial data. We define spatial instances with time constraints brought to a net present value, and then define weighted row instances, weighted table instances and a weighted participation index for the spatial co-location patterns. We propose two algorithms to extract prevalent co-locations from spatial data with time constraints, a w-join-based algorithm that can find all prevalent patterns, and a top-k-w algorithm to find the top k most prevalent co-location patterns. Optimization strategies for the two algorithms are presented. Finally, we show the performance of the proposed algorithms using “real+synthetic” data sets, including the effect of various parameters on the algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Huang, Y., Shekhar, S., Xiong, H.: Discovering co-location patterns from spatial data sets: a general approach. IEEE Transactions on Knowledge and Data Engineering (TKDE) 16(12), 1472–1485 (2004)
Yoo, J.S., Shekhar, S.: A join-less approach for co-location pattern mining: a summary of results. IEEE Transactions on Knowledge and Data Engineering (TKDE) 18(10), 1323–1337 (2006)
Wang, L., Bao, Y., Lu, J., Yip, J.: A new join-less approach for co-location pattern mining. In: The 8th IEEE International Conference on Computer and Information Technology (CIT 2008), pp. 197–202. IEEE Press, New York (2008)
Wang, L., Zhou, L., Lu, J., Yip, J.: An order-clique-based approach for mining maximal co-locations. Information Sciences 179(19), 3370–3382 (2009)
Xiao, X., Xie, X., Luo, Q.: Density-based co-location pattern discovery. In: The 16th ACM SIGSPATIAL Int. Conf. on Advances in Geographic Information Systems, Irvine, California, USA, pp. 11–20. ACM Press (2008)
Huang, Y., Pei, J., Xiong, H.: Mining co-location patterns with rare events from spatial data sets. Geoinformatica 10(3), 239–260 (2006)
Feng, L., Wang, L., Gao, S.: A new approach of mining co-location patterns in spatial datasets with rare features. Journal of Nanjing University (Natural Sciences) 48(1), 99–107 (2012)
Qian, F., He, Q., Chiew, K., He, J.: Spatial co-location pattern discovery without thresholds. Knowledge Information System (2012)
Yoo, J.S., Bow, M.: Mining Top-k Closed Co-Location Patterns. In: The IEEE International Conference on Spatial Data Mining and Geographical Knowledge Services (ICSDM 2011), pp. 100–105. IEEE Press, New York (2011)
Yoo, J.S., Bow, M.: Mining Maximal Co-Located Event sets. In: Huang, J.Z., Cao, L., Srivastava, J. (eds.) PAKDD 2011, Part I. LNCS, vol. 6634, pp. 351–362. Springer, Heidelberg (2011)
Lu, Y., Wang, L., Zhang, X.: Mining frequent co-location patterns from uncertain data. Journal of Frontiers of Computer Science and Technology 3(6), 656–664 (2009)
Wang, L., Chen, H., Zhao, L., Zhou, L.: Efficiently Mining Co-location Rules on Interval Data. In: Cao, L., Feng, Y., Zhong, J. (eds.) ADMA 2010, Part I. LNCS, vol. 6440, pp. 477–488. Springer, Heidelberg (2010)
Ouyang, Z., Wang, L., Chen, H.: Mining spatial co-location patterns for fuzzy objects. Chinese Journal of Computers 34(10), 1947–1955 (2011)
Wang, L., Wu, P., Chen, H.: Finding Probabilistic Prevalent Co-locations in Spatially Uncertain Data Sets. IEEE Transactions on Knowledge and Data Engineering TKDE 25(4), 790–804 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, L., Wu, P., Fan, G., Zhou, Y. (2013). Extracting Prevalent Co-location Patterns from Historic Spatial Data. In: Gao, Y., et al. Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39527-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-39527-7_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39526-0
Online ISBN: 978-3-642-39527-7
eBook Packages: Computer ScienceComputer Science (R0)