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

Haifu Cui, Liang Wu, Zhanjun He, Sheng Hu, Kai Ma, Li Yin and Liufeng Tao
Additional contact information
Haifu Cui: Faculty of Information Engineering, China University of Geosciences, Wuhan 430074, China
Liang Wu: Faculty of Information Engineering, China University of Geosciences, Wuhan 430074, China
Zhanjun He: Faculty of Information Engineering, China University of Geosciences, Wuhan 430074, China
Sheng Hu: Faculty of Information Engineering, China University of Geosciences, Wuhan 430074, China
Kai Ma: Faculty of Information Engineering, China University of Geosciences, Wuhan 430074, China
Li Yin: Department of Urban and Regional Planning, State University of New York, Buffalo, NY 14214, USA
Liufeng Tao: Faculty of Information Engineering, China University of Geosciences, Wuhan 430074, China

IJERPH, 2019, vol. 16, issue 11, 1-19

Abstract: 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.

Keywords: affinity propagation; spatial clustering; Gaussian kernel function; Davies-Bouldin index; trajectory points (search for similar items in EconPapers)
JEL-codes: I I1 I3 Q Q5 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1660-4601/16/11/1988/pdf (application/pdf)
https://www.mdpi.com/1660-4601/16/11/1988/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jijerp:v:16:y:2019:i:11:p:1988-:d:237226

Access Statistics for this article

IJERPH is currently edited by Ms. Jenna Liu

More articles in IJERPH from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().