Détail de l'auteur
Auteur Biao He |
Documents disponibles écrits par cet auteur (2)
![](./images/expand_all.gif)
![](./images/collapse_all.gif)
![Tris disponibles](./images/orderby_az.gif)
A graph-based approach for representing addresses in geocoding / Chen Zhang in Computers, Environment and Urban Systems, vol 100 (March 2023)
![]()
[article]
Titre : A graph-based approach for representing addresses in geocoding Type de document : Article/Communication Auteurs : Chen Zhang, Auteur ; Biao He, Auteur ; Renzhong Guo, Auteur ; et al., Auteur Année de publication : 2023 Article en page(s) : n° 101937 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] appariement d'adresses
[Termes IGN] base de données d'adresses
[Termes IGN] géocodage par adresse postale
[Termes IGN] graphe
[Termes IGN] stockage de données
[Termes IGN] toponymeRésumé : (auteur) Addresses, one of the most important geographical reference systems in natural languages, are usually used to search spatial objects in daily life. Geocoding concatenates text with georeferenced coordinates and is an essential middleware service in geographic information applications. Despite its importance, geocoding remains challenging with only text as input, hindering text matching in reference databases without the specific text. To optimize the storage and retrieval of addresses in databases, this work proposes a graph-based approach for representing addresses. The approach clarifies the characteristics of relative concepts, designs a graph structure and identifies modelling strategies. Furthermore, a schema is proposed to perform address matching and toponym disambiguation using an address graph. The model is implemented on a graph database, and experimental tasks are employed to demonstrate its effectiveness. The approach provides a new reference for developers when creating address databases. Numéro de notice : A2023-126 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1016/j.compenvurbsys.2022.101937 Date de publication en ligne : 04/01/2023 En ligne : https://doi.org/10.1016/j.compenvurbsys.2022.101937 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=102505
in Computers, Environment and Urban Systems > vol 100 (March 2023) . - n° 101937[article]A simple line clustering method for spatial analysis with origin-destination data and its application to bike-sharing movement data / Biao He in ISPRS International journal of geo-information, vol 7 n° 6 (June 2018)
![]()
[article]
Titre : A simple line clustering method for spatial analysis with origin-destination data and its application to bike-sharing movement data Type de document : Article/Communication Auteurs : Biao He, Auteur ; Zhang Yan, Auteur ; Yu Chen, Auteur ; Zhihui Gu, Auteur Année de publication : 2018 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] analyse de groupement
[Termes IGN] analyse spatio-temporelle
[Termes IGN] bicyclette
[Termes IGN] entropie
[Termes IGN] extraction de modèle
[Termes IGN] origine - destination
[Termes IGN] raisonnement spatial
[Termes IGN] voisinage (relation topologique)Résumé : (Auteur) Clustering methods are popular tools for pattern recognition in spatial databases. Existing clustering methods have mainly focused on the matching and clustering of complex trajectories. Few studies have paid attention to clustering origin-destination (OD) trips and discovering strong spatial linkages via OD lines, which is useful in many areas such as transportation, urban planning, and migration studies. In this paper, we present a new Simple Line Clustering Method (SLCM) that was designed to discover the strongest spatial linkage by searching for neighboring lines for every OD trip within a certain radius. This method adopts entropy theory and the probability distribution function for parameter selection to ensure significant clustering results. We demonstrate this method using bike-sharing location data in a metropolitan city. Results show that (1) the SLCM was significantly effective in discovering clusters at different scales, (2) results with the SLCM analysis confirmed known structures and discovered unknown structures, and (3) this approach can also be applied to other OD data to facilitate pattern extraction and structure understanding. Numéro de notice : A2018-345 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3390/ijgi7060203 Date de publication en ligne : 29/05/2018 En ligne : https://doi.org/10.10.3390/ijgi7060203 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90568
in ISPRS International journal of geo-information > vol 7 n° 6 (June 2018)[article]