Détail de l'auteur
Auteur Panagiotis Bouros |
Documents disponibles écrits par cet auteur (1)
![](./images/expand_all.gif)
![](./images/collapse_all.gif)
![Tris disponibles](./images/orderby_az.gif)
Snapshot and continuous points-based trajectory search / Shuyao Qi in Geoinformatica, vol 21 n° 4 (October - December 2017)
![]()
[article]
Titre : Snapshot and continuous points-based trajectory search Type de document : Article/Communication Auteurs : Shuyao Qi, Auteur ; Dimitri Sacharidis, Auteur ; Panagiotis Bouros, Auteur ; Nikos Mamoulis, Auteur Année de publication : 2017 Article en page(s) : pp 669 - 701 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] analyse combinatoire (maths)
[Termes IGN] calcul d'itinéraire
[Termes IGN] distance
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] temps
[Termes IGN] temps instantané
[Termes IGN] théorie des possibilitésRésumé : (Auteur) Trajectory data capture the traveling history of moving objects such as people or vehicles. With the proliferation of GPS and tracking technologies, huge volumes of trajectories are rapidly generated and collected. Under this, applications such as route recommendation and traveling behavior mining call for efficient trajectory retrieval. In this paper, we first focus on distance-to-points trajectory search; given a collection of trajectories and a set query points, the goal is to retrieve the top-k trajectories that pass as close as possible to all query points. We advance the state-of-the-art by combining existing approaches to a hybrid nearest neighbor-based method while also proposing an alternative, more efficient spatial range-based approach. Second, we investigate the continuous counterpart of distance-to-points trajectory search where the query is long-standing and the set of returned trajectories needs to be maintained whenever updates occur to the query and/or the data. Third, we propose and study two practical variants of distance-to-points trajectory search, which take into account the temporal characteristics of the searched trajectories. Through an extensive experimental analysis with real trajectory data, we show that our range-based approach outperforms previous methods by at least one order of magnitude for the snapshot and up to several times for the continuous version of the queries. Numéro de notice : A2017-600 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-016-0267-9 En ligne : https://doi.org/10.1007/s10707-016-0267-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86908
in Geoinformatica > vol 21 n° 4 (October - December 2017) . - pp 669 - 701[article]