Trajectory-based spatiotemporal entity linking is to match the same moving object in different datasets based on their movement traces. It is a fundamental step to support spatiotemporal data integration and analysis. In this paper, we study the problem of spatiotemporal entity linking using effective and concise signatures extracted from their trajectories. This linking problem is formalized as a k-nearest neighbor (k-NN) query on the signatures. Four representation strategies (sequential, temporal, spatial, and spatiotemporal) and two quantitative criteria (commonality and unicity) are investigated for signature construction. A simple yet effective dimension reduction strategy is developed together with a novel indexing structure called the WR-tree to speed up the search. A number of optimization methods are proposed to improve the accuracy and robustness of the linking. Our extensive experiments on real-world datasets verify the superiority of our approach over the state-of-the-art solutions in terms of both accuracy and efficiency.

Jin F., Hua W., Zhou T., Xu J., Francia M., Orowska M., et al. (2022). Trajectory-Based Spatiotemporal Entity Linking. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 34(9), 4499-4513 [10.1109/TKDE.2020.3036633].

Trajectory-Based Spatiotemporal Entity Linking

Francia M.;
2022

Abstract

Trajectory-based spatiotemporal entity linking is to match the same moving object in different datasets based on their movement traces. It is a fundamental step to support spatiotemporal data integration and analysis. In this paper, we study the problem of spatiotemporal entity linking using effective and concise signatures extracted from their trajectories. This linking problem is formalized as a k-nearest neighbor (k-NN) query on the signatures. Four representation strategies (sequential, temporal, spatial, and spatiotemporal) and two quantitative criteria (commonality and unicity) are investigated for signature construction. A simple yet effective dimension reduction strategy is developed together with a novel indexing structure called the WR-tree to speed up the search. A number of optimization methods are proposed to improve the accuracy and robustness of the linking. Our extensive experiments on real-world datasets verify the superiority of our approach over the state-of-the-art solutions in terms of both accuracy and efficiency.
2022
Jin F., Hua W., Zhou T., Xu J., Francia M., Orowska M., et al. (2022). Trajectory-Based Spatiotemporal Entity Linking. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 34(9), 4499-4513 [10.1109/TKDE.2020.3036633].
Jin F.; Hua W.; Zhou T.; Xu J.; Francia M.; Orowska M.; Zhou X.
File in questo prodotto:
File Dimensione Formato  
09250637.pdf

accesso aperto

Tipo: Postprint
Licenza: Licenza per accesso libero gratuito
Dimensione 2.68 MB
Formato Adobe PDF
2.68 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/789283
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 2
social impact