Centre de documentation
scientifique

The annotation process in OpenStreetMap / P. Mooney in Transactions in GIS, vol 16 n° 4 (August 2012)  

Public [article]  inTransactions in GIS > vol 16 n° 4 (August 2012) . - pp 561 - 579 Titre : The annotation process in OpenStreetMap Type de document : Article/Communication Auteurs : P. Mooney, Auteur ; P. Corcoran, Auteur Année de publication : 2012 Article en page(s) : pp 561 - 579 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web [Termes IGN] analyse comparative [Termes IGN] attribut [Termes IGN] données localisées des bénévoles [Termes IGN] objet géographique [Termes IGN] ontologie [Termes IGN] OpenStreetMap Résumé : (Auteur) In this article we describe the analysis of 25,000 objects from the OpenStreetMap (OSM) databases of Ireland, United Kingdom, Germany, and Austria. The objects are selected as exhibiting the characteristics of “heavily edited” objects. We consider “heavily edited” objects as having 15 or more versions over the object's lifetime. Our results indicate that there are some serious issues arising from the way contributors tag or annotate objects in OSM. Values assigned to the “name” and “highway” attributes are often subject to frequent and unexpected change. However, this “tag flip-flopping” is not found to be strongly correlated with increasing numbers of contributors. We also show problems with usage of the OSM ontology/controlled vocabularly. The majority of errors occurring were caused by contributors choosing values from the ontology “by hand” and spelling these values incorrectly. These issues could have a potentially detrimental effect on the quality of OSM data while at the same time damaging the perception of OSM in the GIS community. The current state of tagging and annotation in OSM is not perfect. We feel that the problems identified are a combination of the flexibility of the tagging process in OSM and the lack of a strict mechanism for checking adherence to the OSM ontology for specific core attributes. More studies related to comparing the names of features in OSM to recognized ground-truth datasets are required. Numéro de notice : A2012-366 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/SOCIETE NUMERIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/j.1467-9671.2012.01306.x Date de publication en ligne : 03/05/2012 En ligne : https://doi.org/10.1111/j.1467-9671.2012.01306.x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31812 [article]

An evolutionary algorithm for multicriteria path optimization problems / P. Mooney in International journal of geographical information science IJGIS, vol 20 n° 4 (april 2006)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 20 n° 4 (april 2006) . - pp 401 - 423 Titre : An evolutionary algorithm for multicriteria path optimization problems Type de document : Article/Communication Auteurs : P. Mooney, Auteur ; A. Winstanley, Auteur Année de publication : 2006 Article en page(s) : pp 401 - 423 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes IGN] algorithme évolutionniste [Termes IGN] analyse multicritère [Termes IGN] approximation [Termes IGN] implémentation (informatique) [Termes IGN] optimisation (mathématiques) [Termes IGN] pondération [Termes IGN] système d'information géographique Résumé : (Auteur) For many years researchers and decision makers (DMs) faced with multicriteria shortest path problems (MSPPs) have resorted to reductions to the classical shortest path problem (SPP) by means of weighted linear combinations of the criteria. Algorithmic and approximation schemes are available to solve MSPPs but these approaches often display complexities prohibitive to their implementation on real-world applications. This paper describes the development of an Evolutionary Algorithm (EA) approach to MSPPs on networks with multiple independent criteria. The EA approach is shown to sufficiently explore the underlying network space, generate large candidate path sets, and evolve high quality approximations to the optimal MSPP solution(s). Opportunities for early termination of the EA in time-critical applications are also offered. Among the issues for further work is the integration of the EA as a tool within a GIS for path optimization. Numéro de notice : A2006-180 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810600607766 En ligne : https://doi.org/10.1080/13658810600607766 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27907 [article]

Exemplaires(2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-06041	RAB	Revue	Centre de documentation	En réserve L003	Disponible
079-06042	RAB	Revue	Centre de documentation	En réserve L003	Disponible