Descripteur
Documents disponibles dans cette catégorie (924)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
Efficient maximal reverse skyline query processing / Farnoush Banaei-Kashani in Geoinformatica, vol 21 n° 3 (July - September 2017)
[article]
Titre : Efficient maximal reverse skyline query processing Type de document : Article/Communication Auteurs : Farnoush Banaei-Kashani, Auteur ; Parisa Ghaemi, Auteur ; Bahman Movaqar, Auteur ; Seyed Jalal Kazemitabar, Auteur Année de publication : 2017 Article en page(s) : pp 549 - 572 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] analyse multicritère
[Termes IGN] espace métrique
[Termes IGN] jeu de données localisées
[Termes IGN] opérateur skyline
[Termes IGN] requête (informatique)
[Termes IGN] requête spatiale inverseRésumé : (Auteur) Given a set S of sites and a set O of objects in a metric space, the Optimal Location (OL) problem is about computing a location in the space where introducing a new site (e.g., a retail store) maximizes the number of the objects (e.g., customers) that would choose the new site as their “preferred” site among all sites. However, the existing solutions for the optimal location problem assume that there is only one criterion to determine the preferred site for each object, whereas with numerous real-world applications multiple criteria are used as preference measures. For example, while a single criterion solution might consider the metric distance between the customers and the retail store as the preference measure, a multi-criteria solution might consider the annual membership cost as well as the distance to the retail store to find an optimal location. In this paper, for the first time we develop an efficient and exact solution for the so-called Multi-Criteria Optimal Location (MCOL) problem that can scale with large datasets. Toward that end, first we formalize the MCOL problem as maximal reverse skyline query (MaxRSKY). Given a set of sites and a set of objects in a d-dimensional space, MaxRSKY query returns a location in the space where if a new site s is introduced, the size of the (bichromatic) reverse skyline set of s is maximal. To the best of our knowledge, this paper is the first to define and study MaxRSKY query. Accordingly, we propose a filter-based solution, termed EF-MaxRSKY, that effectively prunes the search space for efficient identification of the optimal location. Our extensive empirical analysis with both real and synthetic datasets show that EF-MaxRSKY is invariably efficient in computing answers for MaxRSKY queries with large datasets containing thousands of sites and objects. Numéro de notice : A2017-381 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-017-0302-5 En ligne : https://doi.org/10.1007/s10707-017-0302-5 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85812
in Geoinformatica > vol 21 n° 3 (July - September 2017) . - pp 549 - 572[article]Graph mapping: Multi-scale community visualization of massive graph data / David Jonker in Information visualization, vol 16 n° 3 (July 2017)
[article]
Titre : Graph mapping: Multi-scale community visualization of massive graph data Type de document : Article/Communication Auteurs : David Jonker, Auteur ; Scott Langevin, Auteur ; David Giesbrecht, Auteur ; et al., Auteur Année de publication : 2017 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] graphe
[Termes IGN] regroupement de données
[Termes IGN] traitement réparti
[Termes IGN] visualisation multiéchelle
[Vedettes matières IGN] GéovisualisationRésumé : (auteur) Graph visualizations increase the perception of entity relationships in a network. However, as graph size and density increases, readability rapidly diminishes. In this article, we present an end-to-end, tile-based visual analytic approach called graph mapping that utilizes cluster computing to turn large-scale graph (node–link) data into interactive visualizations in modern web browsers. Our approach is designed for end-user analysis of community structure and relationships at macro- and micro scales. We also present the results of several experiments using alternate methods for qualitatively improving comprehensibility of hierarchical community detection visualizations by proposing constraints to state-of-the-art modularity maximization algorithms. Numéro de notice : A2017-758 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1177/1473871616661195 En ligne : https://doi.org/10.1177/1473871616661195 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89117
in Information visualization > vol 16 n° 3 (July 2017)[article]A morphologically preserved multi-resolution TIN surface modeling and visualization method for virtual globes / Xianwei Zheng in ISPRS Journal of photogrammetry and remote sensing, vol 129 (July 2017)
[article]
Titre : A morphologically preserved multi-resolution TIN surface modeling and visualization method for virtual globes Type de document : Article/Communication Auteurs : Xianwei Zheng, Auteur ; Hanjiang Xiong, Auteur ; Jianya Gong, Auteur ; Linwei Yue, Auteur Année de publication : 2017 Article en page(s) : pp 41 - 54 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web
[Termes IGN] analyse multiéchelle
[Termes IGN] arbre quadratique
[Termes IGN] globe virtuel
[Termes IGN] représentation cartographique 3D
[Termes IGN] représentation du relief
[Termes IGN] tessellation
[Termes IGN] Triangulated Irregular NetworkRésumé : (Auteur) Virtual globes play an important role in representing three-dimensional models of the Earth. To extend the functioning of a virtual globe beyond that of a “geobrowser”, the accuracy of the geospatial data in the processing and representation should be of special concern for the scientific analysis and evaluation. In this study, we propose a method for the processing of large-scale terrain data for virtual globe visualization and analysis. The proposed method aims to construct a morphologically preserved multi-resolution triangulated irregular network (TIN) pyramid for virtual globes to accurately represent the landscape surface and simultaneously satisfy the demands of applications at different scales. By introducing cartographic principles, the TIN model in each layer is controlled with a data quality standard to formulize its level of detail generation. A point-additive algorithm is used to iteratively construct the multi-resolution TIN pyramid. The extracted landscape features are also incorporated to constrain the TIN structure, thus preserving the basic morphological shapes of the terrain surface at different levels. During the iterative construction process, the TIN in each layer is seamlessly partitioned based on a virtual node structure, and tiled with a global quadtree structure. Finally, an adaptive tessellation approach is adopted to eliminate terrain cracks in the real-time out-of-core spherical terrain rendering. The experiments undertaken in this study confirmed that the proposed method performs well in multi-resolution terrain representation, and produces high-quality underlying data that satisfy the demands of scientific analysis and evaluation. Numéro de notice : A2017-346 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2017.04.013 En ligne : https://dx.doi.org/10.1016/j.isprsjprs.2017.04.013 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85606
in ISPRS Journal of photogrammetry and remote sensing > vol 129 (July 2017) . - pp 41 - 54[article]Réservation
Réserver ce documentExemplaires(3)
Code-barres Cote Support Localisation Section Disponibilité 081-2017071 RAB Revue Centre de documentation En réserve L003 Disponible 081-2017073 DEP-EXM Revue LASTIG Dépôt en unité Exclu du prêt 081-2017072 DEP-EAF Revue Nancy Dépôt en unité Exclu du prêt Popularity-aware collective keyword queries in road networks / Sen Zhao in Geoinformatica, vol 21 n° 3 (July - September 2017)
[article]
Titre : Popularity-aware collective keyword queries in road networks Type de document : Article/Communication Auteurs : Sen Zhao, Auteur ; Xiang Cheng, Auteur ; Sen Su, Auteur ; Kai Shuang, Auteur Année de publication : 2017 Article en page(s) : pp 485 - 518 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web
[Termes IGN] graphe
[Termes IGN] langage de requête
[Termes IGN] langage naturel (informatique)
[Termes IGN] point d'intérêt
[Termes IGN] positionnement automatique
[Termes IGN] requête (informatique)
[Termes IGN] réseau routierRésumé : (Auteur) This paper addresses a popularity-aware collective keyword (PAC-K) query in road networks. Given a road network with POIs (Points of Interest), which is modeled as a road network graph, where each node locating in a two-dimensional space represents a road intersection or a POI, and each edge with weight represents a road segment, the PACK query aims to find a group of popular POIs (i.e., a popular region) that cover the query’s keywords and satisfy the distance requirements from each node to the query node and between each pair of nodes, such that the sum of rating scores over these nodes for the query keywords is maximized. We show the problem of answering the PACK query is NP-Hard. To solve this problem, we present exact and heuristic solutions on small and large road networks, respectively. In particular, to improve query performance, we propose a rating score scaling technique to reduce the search space and a redundant computation reducing technique to reduce the excessive redundant computations in query processing. Extensive performance studies using two real datasets confirm the efficiency, accuracy, and scalability of the proposed solutions. Numéro de notice : A2017-378 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-017-0299-9 En ligne : https://doi.org/10.1007/s10707-017-0299-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85810
in Geoinformatica > vol 21 n° 3 (July - September 2017) . - pp 485 - 518[article]Extracting urban functional regions from points of interest and human activities on location-based social networks / Song Gao in Transactions in GIS, vol 21 n° 3 (June 2017)
[article]
Titre : Extracting urban functional regions from points of interest and human activities on location-based social networks Type de document : Article/Communication Auteurs : Song Gao, Auteur ; Krzysztof Janowicz, Auteur ; Helen Couclelis, Auteur Année de publication : 2017 Article en page(s) : pp 446 - 467 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] classification par nuées dynamiques
[Termes IGN] connaissance thématique
[Termes IGN] Etats-Unis
[Termes IGN] point d'intérêt
[Termes IGN] problème de Dirichlet
[Termes IGN] réseau social géodépendant
[Termes IGN] trace GPS
[Termes IGN] triangulation de Delaunay
[Termes IGN] zone urbaineRésumé : (Auteur) Data about points of interest (POI) have been widely used in studying urban land use types and for sensing human behavior. However, it is difficult to quantify the correct mix or the spatial relations among different POI types indicative of specific urban functions. In this research, we develop a statistical framework to help discover semantically meaningful topics and functional regions based on the co-occurrence patterns of POI types. The framework applies the latent Dirichlet allocation (LDA) topic modeling technique and incorporates user check-in activities on location-based social networks. Using a large corpus of about 100,000 Foursquare venues and user check-in behavior in the 10 most populated urban areas of the US, we demonstrate the effectiveness of our proposed methodology by identifying distinctive types of latent topics and, further, by extracting urban functional regions using K-means clustering and Delaunay triangulation spatial constraints clustering. We show that a region can support multiple functions but with different probabilities, while the same type of functional region can span multiple geographically non-adjacent locations. Since each region can be modeled as a vector consisting of multinomial topic distributions, similar regions with regard to their thematic topic signatures can be identified. Compared with remote sensing images which mainly uncover the physical landscape of urban environments, our popularity-based POI topic modeling approach can be seen as a complementary social sensing view on urban space based on human activities. Numéro de notice : A2017-623 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12289 En ligne : http://dx.doi.org/10.1111/tgis.12289 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86938
in Transactions in GIS > vol 21 n° 3 (June 2017) . - pp 446 - 467[article]Effectiveness of Natura 2000 network in Romanian Alpine Biogeographical Region: an assessment based on forest landscape connectivity / Mihaita Iulian Niculae in Annals of forest research, vol 60 n° 1 (January - June 2017)PermalinkThe analysis and measurement of building patterns using texton co-occurrence matrices / Wenhao Yu in International journal of geographical information science IJGIS, vol 31 n° 5-6 (May-June 2017)PermalinkApproximation algorithms for visibility computation and testing over a terrain / Sharareh Alipour in Applied geomatics, vol 9 n° 1 (March 2017)PermalinkEfficient edge-aware surface mesh reconstruction for urban scenes / András Bódis-Szomorú in Computer Vision and image understanding, vol 157 (April 2017)PermalinkA spatial anomaly points and regions detection method using multi-constrained graphs and local density / Yan Shi in Transactions in GIS, vol 21 n° 2 (April 2017)PermalinkGeodesic equations and their numerical solutions in geodetic and cartesian coordinates on an oblate spheroid / Georgios Panou in Journal of geodetic science, vol 7 n° 1 (February 2017)PermalinkDonnées 3D et SIG en open source / Anonyme in Géomatique expert, n° 114 (janvier - février 2017)PermalinkEtude et méthodes d'intégration et d'interaction de données 3D complexes type "nuages de points" vers un web SIG / Victor Lambert (2017)PermalinkFusion of graph embedding and sparse representation for feature extraction and classification of hyperspectral imagery / Fulin Luo in Photogrammetric Engineering & Remote Sensing, PERS, vol 83 n° 1 (January 2017)PermalinkHigh-quality seamless DEM generation blending SRTM-1, ASTER GDEM v2 and ICESat/GLAS observations / Linwei Yue in ISPRS Journal of photogrammetry and remote sensing, vol 123 (January 2017)PermalinkPermalinkA taxonomy and survey of dynamic graph visualization / Fabian Beck in Computer graphics forum, vol 36 n° 1 (January 2017)PermalinkTélédétection pour l'observation des surfaces continentales, ch. 7. Modèles numériques de terrain à partir de données lidar aéroportées / Clément Mallet (2017)PermalinkExtracting building patterns with multilevel graph partition and building grouping / Shihong Du in ISPRS Journal of photogrammetry and remote sensing, vol 122 (December 2016)PermalinkmR-V: Line simplification through mnemonic rasterization / Emmanuel Stefanakis in Geomatica, vol 70 n° 4 (December 2016)PermalinkLocation-based anonymization: comparison and evaluation of the Voronoi-based aggregation system / William Lee Croft in International journal of geographical information science IJGIS, vol 30 n° 11-12 (November - December 2016)PermalinkSkeletal camera network embedded structure-from-motion for 3D scene reconstruction from UAV images / Zhihua Xua in ISPRS Journal of photogrammetry and remote sensing, vol 121 (November 2016)PermalinkThe D-FCM partitioned D-BSP tree for massive point cloud data access and rendering / Yi Zhang in ISPRS Journal of photogrammetry and remote sensing, vol 120 (october 2016)PermalinkA Topology-inferred graph-based heuristic algorithm for map simplification / QiuLei Guo in Transactions in GIS, vol 20 n° 5 (October 2016)PermalinkBuilding displacement based on the topological structure / Yageng Sun in Cartographic journal (the), Vol 53 n° 3 (August 2016)Permalink