Skip to Main content Skip to Navigation
Conference papers

Finding Structurally and Temporally Similar Trajectories in Graphs

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-02956070
Contributor : Marie-France Sagot <>
Submitted on : Friday, October 2, 2020 - 1:10:38 PM
Last modification on : Saturday, October 3, 2020 - 4:07:27 AM

File

LIPIcs-SEA-2020-24.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

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

Share

Metrics

Record views

10

Files downloads

118