Centre dedocumentation
scientifique

GeoTxt: A scalable geoparsing system for unstructured text geolocation / Morteza Karimzadeh in Transactions in GIS, vol 23 n° 1 (February 2019)  

Public [article]  inTransactions in GIS > vol 23 n° 1 (February 2019) . - pp 118 - 136 Titre : GeoTxt: A scalable geoparsing system for unstructured text geolocation Type de document : Article/Communication Auteurs : Morteza Karimzadeh, Auteur ; Scott Pezanowski, Auteur ; Alan M. MacEachren, Auteur ; Jan Oliver Wallgrün, Auteur Année de publication : 2019 Article en page(s) : pp 118 - 136 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Informatique [Termes descripteurs IGN] analyse sémantique [Termes descripteurs IGN] analyse syntaxique [Termes descripteurs IGN] appariement de données localisées [Termes descripteurs IGN] corpus [Termes descripteurs IGN] données issues des réseaux sociaux [Termes descripteurs IGN] interface de programmation [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] reconnaissance de noms [Termes descripteurs IGN] répertoire toponymique [Termes descripteurs IGN] réseau sémantique [Termes descripteurs IGN] toponyme [Termes descripteurs IGN] traitement du langage naturel Résumé : (auteur) In this article, we present GeoTxt, a scalable geoparsing system for the recognition and geolocation of place names in unstructured text. GeoTxt offers six named entity recognition (NER) algorithms for place name recognition, and utilizes an enterprise search engine for the indexing, ranking, and retrieval of toponyms, enabling scalable geoparsing for streaming text. GeoTxt offers a flexible application programming interface (API), allowing for customized attribute and/or spatial ranking of retrieved toponyms. We evaluate the system on a corpus of manually geo‐annotated tweets. First, we benchmark the performance of the six NERs that GeoTxt provides access to. Second, we assess GeoTxt toponym resolution accuracy incrementally, demonstrating improvements in toponym resolution achieved (or not achieved) by adding specific heuristics and disambiguation methods. Compared to using the GeoNames web service, GeoTxt's toponym resolution demonstrates a 20% accuracy gain. Our results show that places mentioned in the same tweet do not tend to be geographically proximate. Numéro de notice : A2019-091 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12510 date de publication en ligne : 16/01/2019 En ligne : https://doi.org/10.1111/tgis.12510 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92238 [article]

A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks / Shaohua Wang in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 32 n° 7-8 (July - August 2018) . - pp 1368 - 1390 Titre : A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks Type de document : Article/Communication Auteurs : Shaohua Wang, Auteur ; Song Gao, Auteur ; Xin Feng, Auteur ; Alan T. Murray, Auteur ; Yuan Zeng Année de publication : 2018 Article en page(s) : pp 1368 - 1390 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG [Termes descripteurs IGN] Arbre-R [Termes descripteurs IGN] chaîne de traitement [Termes descripteurs IGN] chemin le plus court (algorithme) [Termes descripteurs IGN] démonstration de faisabilité [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] objet mobile [Termes descripteurs IGN] optimisation (mathématiques) [Termes descripteurs IGN] position [Termes descripteurs IGN] prise en compte du contexte [Termes descripteurs IGN] réseau routier Résumé : (Editeur) Given different types of constraints on human life, people must make decisions that satisfy social activity needs. Minimizing costs (i.e. distance, time, or money) associated with travel plays an important role in perceived and realized social quality of life. Identifying optimal interaction locations on road networks when there are multiple moving objects (MMO) with space–time constraints remains a challenge. In this research, we formalize the problem of finding dynamic ideal interaction locations for MMO as a spatial optimization model and introduce a context-based geoprocessing heuristic framework to address this problem. As a proof of concept, a case study involving identification of a meetup location for multiple people under traffic conditions is used to validate the proposed geoprocessing framework. Five heuristic methods with regard to efficient shortest-path search space have been tested. We find that the R* tree-based algorithm performs the best with high quality solutions and low computation time. This framework is implemented in a geographic information systems environment to facilitate integration with external geographic contextual information, e.g. temporary road barriers, points of interest, and real-time traffic information, when dynamically searching for ideal meetup sites. The proposed method can be applied in trip planning, carpooling services, collaborative interaction, and logistics management. Numéro de notice : A2018-278 Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658816.2018.1431838 En ligne : https://doi.org/10.1080/13658816.2018.1431838 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90360 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-2018041	SL	Revue	Centre de documentation	Revues en salle	Disponible

A Topology-inferred graph-based heuristic algorithm for map simplification / QiuLei Guo in Transactions in GIS, vol 20 n° 5 (October 2016)  

Public [article]  inTransactions in GIS > vol 20 n° 5 (October 2016) . - pp 775 – 789 Titre : A Topology-inferred graph-based heuristic algorithm for map simplification Type de document : Article/Communication Auteurs : QiuLei Guo, Auteur ; Hassan A. Karimi, Auteur Année de publication : 2016 Article en page(s) : pp 775 – 789 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de généralisation [Termes descripteurs IGN] carte heuristique [Termes descripteurs IGN] graphe [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] polyligne [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] temps réel [Termes descripteurs IGN] voisinage (topologie) [Vedettes matières IGN] Généralisation Résumé : (auteur) In this article, we present a heuristic map simplification algorithm based on a novel topology-inferred graph model. Compared with the existing algorithms, which only focus either on geometry simplification or on topological consistency, our algorithm simplifies the map composed of series of polylines and constraint points while maintaining the topological relationships in the map, maximizing the number of removal points, and minimizing error distance efficiently. Unlike some traditional geometry simplification algorithms, such as Douglas and Peucker's, which add points incrementally, we remove points sequentially based on a priority determined by heuristic functions. In the first stage, we build a graph to model the topology of points in the map from which we determine whether a point is removable or not. As map generalization is needed in different applications with different requirements, we present two heuristic functions to determine the priority of points removal for two different purposes: to save storage space and to reduce computation time. The time complexity of our algorithm is math formula which is efficient enough to be considered for real-time applications. Experiments on real maps were conducted and the results indicate that our algorithm produces high quality results; one heuristic function results in higher removal points saving storage space and the other improves the time performance significantly. Numéro de notice : A2016-999 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : http://dx.doi.org/10.1111/tgis.12188 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=83779 [article]

The Visvalingam algorithm: metrics, measures and heuristics / Mahes Visvalingam in Cartographic journal (the), Vol 53 n° 3 (August 2016)  

Public [article]  inCartographic journal (the) > Vol 53 n° 3 (August 2016) . - pp 242 - 252 Titre : The Visvalingam algorithm: metrics, measures and heuristics Type de document : Article/Communication Auteurs : Mahes Visvalingam, Auteur Année de publication : 2016 Article en page(s) : pp 242 - 252 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de généralisation [Termes descripteurs IGN] algorithme de Visvalingam [Termes descripteurs IGN] généralisation cartographique automatisée [Termes descripteurs IGN] littoral [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] métrique [Vedettes matières IGN] Généralisation Résumé : (auteur) This paper provides the background necessary for a clear understanding of forthcoming papers relating to the Visvalingam algorithm for line generalization, for example on the testing and usage of its implementations. It distinguishes the algorithm from implementation-specific issues to explain why it is possible to get inconsistent but equally valid output from different implementations. By tracing relevant developments within the now-disbanded Cartographic Information Systems Research Group (CISRG) of the University of Hull, it explains why (a) a partial metric-driven implementation was, and still is, sufficient for many projects but not for others; (b) why the effective area (EA) is a measure derived from a metric; (c) why this measure (EA) may serve as a heuristic indicator for in-line feature segmentation and model-based generalization; (d) how metrics may be combined to change the order of point elimination; and (e) how Tobler's rule-of-thumb is useful for scale-related filtering of EA. The issues discussed in this paper also apply to the use of other metrics. It is hoped that the background and guidance provided in this paper will enable others to participate in further research based on the algorithm. Numéro de notice : A2016-681 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : http://dx.doi.org/10.1080/00087041.2016.1151097 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81938 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
030-2016031	SL	Revue	Centre de documentation	Revues en salle	Disponible

Spatial optimization for regionalization problems with spatial interaction: a heuristic approach / K. Kim in International journal of geographical information science IJGIS, vol 30 n° 3-4 (March - April 2016)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 30 n° 3-4 (March - April 2016) . - pp 451 - 473 Titre : Spatial optimization for regionalization problems with spatial interaction: a heuristic approach Type de document : Article/Communication Auteurs : K. Kim, Auteur ; Non-répertorié, Auteur ; B. Kim, Auteur Année de publication : 2016 Article en page(s) : pp 451 - 473 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] interaction spatiale [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] optimisation spatiale [Termes descripteurs IGN] régionalisation Résumé : (Auteur) Spatial optimization techniques are commonly used for regionalization problems, often represented as p-regions problems. Although various spatial optimization approaches have been proposed for finding exact solutions to p-regions problems, these approaches are not practical when applied to large-size problems. Alternatively, various heuristics provide effective ways to find near-optimal solutions for p-regions problem. However, most heuristic approaches are specifically designed for particular geographic settings. This paper proposes a new heuristic approach named Automated Zoning Procedure-Center Interchange (AZP-CI) to solve the p-functional regions problem (PFRP), which constructs regions by combining small areas that share common characteristics with predefined functional centers and have tight connections among themselves through spatial interaction. The AZP-CI consists of two subprocesses. First, the dissolving/splitting process enhances diversification and thereby produces an extensive exploration of the solution space. Second, the standard AZP locally improves the objective value. The AZP-CI was tested using randomly simulated datasets and two empirical datasets with different sizes. These evaluations indicate that AZP-CI outperforms two established heuristic algorithms: the AZP and simulated annealing, in terms of both solution quality and consistency of producing reliable solutions regardless of initial conditions. It is also noted that AZP-CI, as a general heuristic method, can be easily extended to other regionalization problems. Furthermore, the AZP-CI could be a more scalable algorithm to solve computational intensive spatial optimization problems when it is combined with cyberinfrastructure. Numéro de notice : A2016-203 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2015.1031671 En ligne : https://doi.org/10.1080/13658816.2015.1031671 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=79889 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-2016021	RAB	Revue	Centre de documentation	En réserve 3L	Disponible

A linear indexing approach to mass movements susceptibility mapping. The case of the Chefchaouen province (Morocco) / Mohamed Mastere in Revue internationale de géomatique, vol 25 n° 2 (juin - août 2015)  

Permalink

TARS: traffic-aware route search / Roy Levin in Geoinformatica, vol 18 n° 3 (July 2014)

Permalink

Active learning in the spatial domain for remote sensing image classification / André Stumpf in IEEE Transactions on geoscience and remote sensing, vol 52 n° 5 tome 1 (May 2014)

Permalink

Aggregation of LoD 1 building models as an optimization problem / R. Guercke in ISPRS Journal of photogrammetry and remote sensing, vol 66 n° 2 (March - April 2011)

Permalink

Automatic revision of the control knowledge used by trial and error methods: Application to cartographic generalisation / Patrick Taillandier in Applied soft computing, vol 11 n° 2 (March 2011)  

Permalink

Area aggregation in map generalisation by mixed-integer programming / Jan‐Henrik Haunert in International journal of geographical information science IJGIS, vol 24 n°11-12 (december 2010)  

Permalink

Finding shortest paths on real road networks: the case for A* / W. Zeng in International journal of geographical information science IJGIS, vol 23 n°3-4 (march - april 2009)

Permalink

Révision automatique des connaissances guidant l'exploration informée d'arbres d'états / Patrick Taillandier (2008) 

Permalink

Classified road detection from satellite images based on perceptual organization / J. Yang in International Journal of Remote Sensing IJRS, vol 28 n°19-20 (October 2007)

Permalink

A shortest path algorithm with novel heuristics for dynamic transportation networks / B. Huang in International journal of geographical information science IJGIS, vol 21 n° 6-7 (july 2007)

Permalink