Centre de documentation
scientifique

Location-based algorithms for finding sets of corresponding objects over several geo-spatial data sets / E. Safra in International journal of geographical information science IJGIS, vol 24 n°1-2 (january 2010)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 24 n°1-2 (january 2010) . - pp 69 - 106 Titre : Location-based algorithms for finding sets of corresponding objects over several geo-spatial data sets Type de document : Article/Communication Auteurs : E. Safra, Auteur ; Yaron Kanza, Auteur ; Y. Sagiv, Auteur ; et al., Auteur Année de publication : 2010 Article en page(s) : pp 69 - 106 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] analyse comparative [Termes IGN] classification barycentrique [Termes IGN] imprécision géométrique [Termes IGN] intégration de données [Termes IGN] jeu de données localisées [Termes IGN] jointure spatiale [Termes IGN] objet géographique Résumé : (Auteur) When integrating geo-spatial data sets, a join algorithm is used for finding sets of corresponding objects (i.e., objects that represent the same real-world entity). This article investigates location-based join algorithms for integration of several data sets. First, algorithms for integration of two data sets are presented and their performances, in terms of recall and precision, are compared. Then, two approaches for integration of more than two data sets are described. In one approach, all the integrated data sets are processed simultaneously. In the second approach, a join algorithm for two data sets is applied sequentially, either in a serial manner, where in each join at least one of the joined data sets is a single source, or in a hierarchical manner, where two join results can be joined. For the two approaches, join algorithms are given. The algorithms are designed to perform well even when location of objects are imprecise and each data set represents only some of the real-world entities. Results of extensive experiments with the different approaches are provided and analyzed. The experiments show the differences, in accuracy and efficiency, between the approaches, under different circumstances. The results also show that all our algorithms have much better accuracy than applying the commonly used one-sided nearest-neighbor join. Copyright Taylor & Francis Numéro de notice : A2010-113 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810802275560 En ligne : http://dx.doi.org/10.1080/13658810802275560 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30309 [article]

Exemplaires(2)

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