Next Article in Journal
Environmental Correlates of Motor Competence in Children—The Skilled Kids Study
Next Article in Special Issue
Urban Road Network Expansion and Its Driving Variables: A Case Study of Nanjing City
Previous Article in Journal
Beach Pollution Effects on Health and Productivity in California
Previous Article in Special Issue
Investigating the Spatiotemporal Variability and Driving Factors of Artificial Lighting in the Beijing-Tianjin-Hebei Region Using Remote Sensing Imagery and Socioeconomic Data
Open AccessArticle

Exploring Multidimensional Spatiotemporal Point Patterns Based on an Improved Affinity Propagation Algorithm

by Haifu Cui 1, Liang Wu 1,2,*, Zhanjun He 1,2, Sheng Hu 1, Kai Ma 1, Li Yin 3 and Liufeng Tao 1,2
1
Faculty of Information Engineering, China University of Geosciences, Wuhan 430074, China
2
National Engineering Research Center of Geographic Information System, Wuhan 430074, China
3
Department of Urban and Regional Planning, State University of New York, Buffalo, NY 14214, USA
*
Author to whom correspondence should be addressed.
Int. J. Environ. Res. Public Health 2019, 16(11), 1988; https://doi.org/10.3390/ijerph16111988
Received: 4 April 2019 / Revised: 30 May 2019 / Accepted: 31 May 2019 / Published: 4 June 2019
(This article belongs to the Special Issue Spatio-Temporal Environmental Monitoring and Social Sensing)
Affinity propagation (AP) is a clustering algorithm for point data used in image recognition that can be used to solve various problems, such as initial class representative point selection, large-scale sparse matrix calculations, and large-scale data with fewer parameter settings. However, the AP clustering algorithm does not consider spatiotemporal information and multiple thematic attributes simultaneously, which leads to poor performance in discovering patterns from massive spatiotemporal points (e.g., trajectory points). To resolve this issue, a multidimensional spatiotemporal affinity propagation (MDST-AP) algorithm is proposed in this study. First, the similarity of spatial and nonspatial attributes is measured in Gaussian kernel space instead of Euclidean space, which helps address the multidimensional linear inseparability problem. Then, the Davies-Bouldin (DB) index is applied to optimize the parameter value of the MDST-AP algorithm, which is applied to analyze road congestion in Beijing via taxi trajectories. Experiments on different datasets and algorithms indicated that the MDST-AP algorithm can process multidimensional spatiotemporal data points faster and more effectively. View Full-Text
Keywords: affinity propagation; spatial clustering; Gaussian kernel function; Davies-Bouldin index; trajectory points affinity propagation; spatial clustering; Gaussian kernel function; Davies-Bouldin index; trajectory points
Show Figures

Figure 1

MDPI and ACS Style

Cui, H.; Wu, L.; He, Z.; Hu, S.; Ma, K.; Yin, L.; Tao, L. Exploring Multidimensional Spatiotemporal Point Patterns Based on an Improved Affinity Propagation Algorithm. Int. J. Environ. Res. Public Health 2019, 16, 1988.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop