Geoinformatica . vol 25 n° 3Mention de date : July 2021 Paru le : 01/07/2021 |
[n° ou bulletin]
est un bulletin de Geomatica / Canadian institute of geomatics = Association canadienne des sciences géomatiques (Canada) (1993 -)
[n° ou bulletin]
|
Dépouillements
Ajouter le résultat dans votre panierImproving human mobility identification with trajectory augmentation / Fan Zhou in Geoinformatica, vol 25 n° 3 (July 2021)
[article]
Titre : Improving human mobility identification with trajectory augmentation Type de document : Article/Communication Auteurs : Fan Zhou, Auteur ; Ruiyang Yin, Auteur ; Goce Trajcevski, Auteur ; Kunpeng Zhang, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 453 - 483 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] itinéraire
[Termes IGN] mobilité humaine
[Termes IGN] modèle numérique de déplacement
[Termes IGN] réseau antagoniste génératif
[Termes IGN] réseau neuronal convolutif
[Termes IGN] réseau neuronal récurrent
[Termes IGN] utilisateurRésumé : (auteur) Many location-based social networks (LBSNs) applications such as customized Point-Of-Interest (POI) recommendation, preference-based trip planning, travel time estimation, etc., involve an important task of understanding human trajectory patterns. In particular, identifying and linking trajectories to users who generate them – a problem called Trajectory-User Linking (TUL) – has become a focus of many recent works. TUL is usually studied as a multi-class classification problem and has gained recent attention because: (1) the number of labels/classes (i.e., users) is way larger than the number of motion patterns among various trajectories; and (2) the location-based trajectory data, especially the check-ins – i.e., events of reporting a location at particular Point of Interest (POI) with known semantics – are often extremely sparse. Towards addressing these challenges, we introduce a Trajectory Generative Adversarial Network (TGAN) as an approach to enable learning users motion patterns and location distribution, and to eventually identify human mobility. TGAN consists of two jointly trained neural networks, playing a Minimax game to (iteratively) optimize both components. The first one is the generator, learning trajectory representation by a Recurrent Neural Network (RNN) based model, aiming at fitting the underlying trajectory distribution of a particular individual and generate synthetic trajectories with intrinsic invariance and global coherence. The second one is the discriminator – a Convolutional Neural Network (CNN) based model that discriminates the generated trajectory from the real ones and provides guidance to train the generator model. We demonstrate that the above two models can be well tuned together to improve the TUL performance, while achieving superior accuracy when compared to existing approaches. Numéro de notice : A2021-972 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-019-00378-7 Date de publication en ligne : 29/08/2019 En ligne : https://doi.org/10.1007/s10707-019-00378-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=100390
in Geoinformatica > vol 25 n° 3 (July 2021) . - pp 453 - 483[article]Geographical and temporal huff model calibration using taxi trajectory data / Shuhui Gong in Geoinformatica, vol 25 n° 3 (July 2021)
[article]
Titre : Geographical and temporal huff model calibration using taxi trajectory data Type de document : Article/Communication Auteurs : Shuhui Gong, Auteur ; John Cartlidge, Auteur ; Ruibin Bai, Auteur ; Yang Yue, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 485 - 512 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] attractivité (aménagement)
[Termes IGN] étalonnage de modèle
[Termes IGN] New York (Etats-Unis ; ville)
[Termes IGN] régression des moindres carrés partiels
[Termes IGN] régression géographiquement pondérée
[Termes IGN] Shenzhen
[Termes IGN] trajectoire (véhicule non spatial)Résumé : (auteur) The Huff model is designed to estimate the probability of shopping centre patronage based on a shopping centre’s attractiveness and the cost of a customer’s travel. In this paper, we attempt to discover some general shopping trends by calibrating the Huff model in Shenzhen, China, and New York, USA, using taxi trajectory GPS data and sharing bikes GPS data. Geographical and Temporal Weighted Regression (GTWR) is used to fit the model, and calibration results are compared with Ordinary Least Squares (OLS) regression, Geographical Weighted Regression (GWR), and Temporal Weighted Regression (TWR). Results show that GTWR gives the highest performance due to significant geographical and temporal variation in the Huff model parameters of attractiveness and travel cost. To explain the geographical variation, we use residential sales’ and rental prices in Shenzhen and New York as a proxy for customers’ wealth in each region. Pearson product-moment correlation results show a medium relationship between localised sales’ and rental prices and the Huff model parameter of attractiveness: that is, customer wealth explains geographic sensitivity to shopping area attractiveness. To explain temporal variation, we use census data in both Shenzhen and New York to provide job profile distributions for each region as a proxy to estimate customers’ spare leisure time. Regression results demonstrate that there is a significant linear relationship between the length of spare time and the parameter of shopping area attractiveness. In particular, we demonstrate that wealthy customers with less spare time are more sensitive to a shopping centre’s attractiveness. We also discover customers’ sensitivities to travel distance are related to their travel mode. In particular, people riding bikes to shopping areas care much more about trip distance compared with people who take taxi. Finally, results show a divergence in behaviours between customers in New York and Shenzhen at weekends. While customers in New York prefer to shop more locally at weekends, customers in Shenzhen care less about trip distance. We provide the GTWR calibration of the Huff model as our theoretical contribution. GTWR extends the Huff model to two dimensions (time and space), so as to analyse the differences of residents’ travel behaviours in different time and locations. We also provide the discoveries of factors affecting urban travel behaviours (wealth and employment) as practical contributions that may help optimise urban transportation design. In particular, the sensitivity of residents to the attraction of shopping areas has a significant positive linear relationship with the housing price and a significant negative linear relationship with the residents’ length of spare time. Numéro de notice : A2021-973 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/URBANISME Nature : Article DOI : 10.1007/s10707-019-00390-x Date de publication en ligne : 18/02/2020 En ligne : https://doi.org/10.1007/s10707-019-00390-x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=100392
in Geoinformatica > vol 25 n° 3 (July 2021) . - pp 485 - 512[article]Constrained shortest path problems in bi-colored graphs: a label-setting approach / Amin AliAbdi in Geoinformatica, vol 25 n° 3 (July 2021)
[article]
Titre : Constrained shortest path problems in bi-colored graphs: a label-setting approach Type de document : Article/Communication Auteurs : Amin AliAbdi, Auteur ; Ali Mohades, Auteur ; Mansoor Davoodi, Auteur Année de publication : 2021 Article en page(s) : pp 513 - 531 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] calcul d'itinéraire
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] données d'entrainement sans étiquette
[Termes IGN] graphe
[Termes IGN] programmation par contraintesRésumé : (auteur) Definition of an optimal path in the real-world routing problems is not necessarily the shortest one, because parameters such as travel time, safety, quality, and smoothness also played essential roles in the definition of optimality. In this paper, we use bi-colored graphs for modeling urban and heterogeneous environments and introduce variations of constraint routing problems. Bi-colored graphs are a kind of directed graphs whose vertices are divided into two subsets of white and gray. We consider two criteria, minimizing the length and minimizing the number of gray vertices and present two problems called gray vertices bounded shortest path problem and length bounded shortest path problem on bi-colored graphs. We propose an efficient time label-setting algorithm to solve these problems. Likewise, we simulate the algorithm and compare it with the related path planning methods on random graphs as well as real-world environments. The simulation results show the efficiency of the proposed algorithm. Numéro de notice : A2021-974 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-019-00385-8 Date de publication en ligne : 03/12/2019 En ligne : https://doi.org/10.1007/s10707-019-00385-8 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=100393
in Geoinformatica > vol 25 n° 3 (July 2021) . - pp 513 - 531[article]