Abstract
Spatio-temporal clustering, which is a process of grouping objects based on their spatial and temporal similarity, is increasingly gaining more scientific attention. Research in spatio-temporal clustering mainly focuses on approaches that use time and space in parallel. In this paper, we introduce a serial spatio-temporal clustering algorithm, called ST-DPOLY, which creates spatial clusters first and then creates spatio-temporal clusters by identifying continuing relationships between the spatial clusters in consecutive time frames. We compare this serial approach with a parallel approach named ST-SNN. Both ST-DPOLY and ST-SNN are density-based clustering approaches: while ST-DPOLY employs a density-contour based approach that operates on an actual density function, ST-SNN is based on well-established generic clustering algorithm Shared Nearest Neighbor (SNN). We demonstrate the effectiveness of these two approaches in a case study involving a New York city taxi trip dataset. The experimental results show that both ST-DPOLY and ST-SNN can find interesting spatio-temporal patterns in the dataset. Moreover, in terms of time and space complexity, ST-DPOLY has advantages over ST-SNN, while ST-SNN is more superior in terms of temporal flexibility; in terms of clustering results, results of ST-DPOLY are easier to interpret, while ST-SNN obtains more clusters which overlap with each other either spatially or temporally, which makes interpreting its clustering results more complicated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gaudart, J., Poudiougou, B., Dicko, A., Ranque, S., Toure, O., Sagara, I., Diallo, M., Diawara, S., Ouattara, A., Diakite, M., et al.: Space-time clustering of childhood malaria at the household level: a dynamic cohort in a mali village. BMC Public Health 6(1), 286 (2006)
Grubesic, T.H., Mack, E.A.: Spatio-temporal interaction of urban crime. J. Quant. Criminol. 24(3), 285–306 (2008)
Zhang, Y., Eick, C.F.: Novel clustering and analysis techniques for mining spatio-temporal data. In: Proceedings of the 1st ACM SIGSPATIAL Ph.D. Workshop, Article no. 2. ACM (2014)
Birant, D., Kut, A.: ST-DBSCAN: an algorithm for clustering spatial-temporal data. Data Knowl. Eng. 60(1), 208–221 (2007)
Zhang, Y., Eick, C.F.: ST-DCONTOUR: a serial, density-contour based spatio-temporal clustering approach to cluster location streams. In: Proceedings of the 7th ACM SIGSPATIAL International Workshop on GeoStreaming, Article no. 5. ACM (2016)
Wang, S., Cai, T., Eick, C.F.: New spatiotemporal clustering algorithms and their applications to ozone pollution. In: 2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW), pp. 1061–1068. IEEE (2013)
Ertöz, L., Steinbach, M., Kumar, V.: Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In: Proceedings of the 2003 SIAM International Conference on Data Mining, pp. 47–58. SIAM (2003)
Epanechnikov, V.A.: Non-parametric estimation of a multivariate probability density. Theory Probab. Appl. 14(1), 153–158 (1969)
Ripley, M.B., Suggests, M.: The kernsmooth package (2007)
Bourke, P.D.: A contouring subroutine. Byte 12(6), 143–150 (1987)
http://www.nyc.gov/html/tlc/html/about/trip_record_data.shtml. Accessed 23 Aug 2016
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Zhang, Y., Wang, S., Aryal, A.M., Eick, C.F. (2017). “Serial” versus “Parallel”: A Comparison of Spatio-Temporal Clustering Approaches. In: Kryszkiewicz, M., Appice, A., Ślęzak, D., Rybinski, H., Skowron, A., Raś, Z. (eds) Foundations of Intelligent Systems. ISMIS 2017. Lecture Notes in Computer Science(), vol 10352. Springer, Cham. https://doi.org/10.1007/978-3-319-60438-1_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-60438-1_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60437-4
Online ISBN: 978-3-319-60438-1
eBook Packages: Computer ScienceComputer Science (R0)