Finding Structurally and Temporally Similar Trajectories in Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Finding Structurally and Temporally Similar Trajectories in Graphs

(1, 2) , (3) , (1)
1
2
3

Abstract

The analysis of similar motions in a network provides useful information for different applications like route recommendation. We are interested in algorithms to efficiently retrieve trajectories that are similar to a given query trajectory. For this task many studies have focused on extracting the geometrical information of trajectories. In this paper we investigate the properties of trajectories moving along the paths of a network. We provide a similarity function by making use of both the temporal aspect of trajectories and the structure of the underlying network. We propose an approximation technique that offers the top-k similar trajectories with respect to a query trajectory in an efficient way with acceptable precision. We investigate our method over real-world networks, and our experimental results show the effectiveness of the proposed method. Acknowledgements We are in debt with Ioanna Miliou for helping us with the Milan GPS dataset.
Fichier principal
Vignette du fichier
LIPIcs-SEA-2020-24.pdf (1.87 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-02956070 , version 1 (02-10-2020)

Identifiers

Cite

Roberto Grossi, Andrea Marino, Shima Moghtasedi. Finding Structurally and Temporally Similar Trajectories in Graphs. SEA 2020 - 18th International Symposium on Experimental Algorithms, Jun 2020, Catania, Italy. pp.1-13, ⟨10.4230/LIPIcs.SEA.2020.24⟩. ⟨hal-02956070⟩

Collections

INRIA INRIA2
29 View
74 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More