Centre dedocumentation
scientifique

Dépouillements

Towards dynamic behavior-based profiling for reducing spatial information overload in map browsing activity / E. Mac Aoidh in Geoinformatica, vol 16 n° 3 (July 2012)  

Public [article]  inGeoinformatica > vol 16 n° 3 (July 2012) . - pp 409 - 434 Titre : Towards dynamic behavior-based profiling for reducing spatial information overload in map browsing activity Type de document : Article/Communication Auteurs : E. Mac Aoidh, Auteur ; Michela Bertolotto, Auteur ; D. Wilson, Auteur Année de publication : 2012 Article en page(s) : pp 409 - 434 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web [Termes IGN] comportement [Termes IGN] données localisées [Termes IGN] filtrage du rayonnement [Termes IGN] interface utilisateur [Termes IGN] superposition de données [Termes IGN] système d'information géographique [Termes IGN] visualisation de données Résumé : (Auteur) The quantity of available detailed spatial content over the Web is continually growing. This leads to the problems of information overload and lengthy map download and render times. In order to address these problems in an effective and unobtrusive manner, the available content must be implicitly filtered and prioritized according to the user’s interests. Personalization of the user’s map elides less relevant information and prioritizes relevant information. The authors previously introduced a novel technique for detailed behavior-based spatial profiling. This article provides an analysis of the technique while exploring the properties of user interactions with a typical Web-based map browsing system. A technique for the automatic identification of specific interaction patterns is introduced and explored in a bid to improve current behavior-based map personalization techniques. The goal of this work is to move towards real-time profiling to support spatial dataset personalization, thus improving the user experience by reducing information overload. Numéro de notice : A2012-105 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-011-0137-4 Date de publication en ligne : 15/09/2011 En ligne : https://doi.org/10.1007/s10707-011-0137-4 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31553 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2012031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Retrospective adaptive prefetching for interactive Web GIS applications / S. Yesilmurat in Geoinformatica, vol 16 n° 3 (July 2012)  

Public [article]  inGeoinformatica > vol 16 n° 3 (July 2012) . - pp 435 - 466 Titre : Retrospective adaptive prefetching for interactive Web GIS applications Type de document : Article/Communication Auteurs : S. Yesilmurat, Auteur ; V. Isler, Auteur Année de publication : 2012 Article en page(s) : pp 435 - 466 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web [Termes IGN] mise à jour automatique [Termes IGN] téléchargement [Termes IGN] traitement interactif [Termes IGN] WebSIG Résumé : (Auteur) A major task of a Web GIS (Geographic Information Systems) system is to transfer map data to client applications over the Internet, which may be too costly. To improve this inefficient process, various solutions are available. Caching the responses of the requests on the client side is the most commonly implemented solution. However, this method may not be adequate by itself. Besides caching the responses, predicting the next possible requests from a client and updating the cache with responses for those requests together provide a remarkable performance improvement. This procedure is called “prefetching” and makes caching mechanisms more effective and efficient. This paper proposes an efficient prefetching algorithm called Retrospective Adaptive Prefetch (RAP), which is constructed over a heuristic method that considers the former actions of a given user. The algorithm reduces the user-perceived response time and improves user navigation efficiency. Additionally, it adjusts the cache size automatically, based on the memory size of the client’s machine. RAP is compared with four other prefetching algorithms. The experiments show that RAP provides better performance enhancements than the other methods. Numéro de notice : A2012-106 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-011-0141-8 Date de publication en ligne : 08/10/2011 En ligne : https://doi.org/10.1007/s10707-011-0141-8 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31554 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2012031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

PNN query processing on compressed trajectories / S. Shang in Geoinformatica, vol 16 n° 3 (July 2012)  

Public [article]  inGeoinformatica > vol 16 n° 3 (July 2012) . - pp 467 - 496 Titre : PNN query processing on compressed trajectories Type de document : Article/Communication Auteurs : S. Shang, Auteur ; B. Yuan, Auteur ; et al., Auteur Année de publication : 2012 Article en page(s) : pp 467 - 496 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] plus proche voisin, algorithme du [Termes IGN] reconstruction d'objet [Termes IGN] réseau routier [Termes IGN] trajectographie (positionnement) Résumé : (Auteur) Trajectory compression is widely used in spatial-temporal databases as it can notably reduce (i) the computation/communication load of clients (GPS-enabled mobile devices) and (ii) the storage cost of servers. Compared with original trajectories, compressed trajectories have clear advantages in data processing, transmitting, storing, etc. In this paper, we investigate a novel problem of searching the Path Nearest Neighbor based on Compressed Trajectories (PNN-CT query). This type of query is conducted on compressed trajectories and the target is to retrieve the PNN with the highest probability (lossy compression leads to the uncertainty), which can bring significant benefits to users in many popular applications such as trip planning. To answer the PNN-CT query effectively and efficiently, a two-phase solution is proposed. First, we use the meta-data and sample points to specify a tight search range. The key of this phase is that the number of data objects/trajectory segments to be processed or decompressed should be kept as small as possible. Our efficiency study reveals that the candidate sets created are tight. Second, we propose a reconstruction algorithm based on probabilistic models to account for the uncertainty when decompressing the trajectory segments in the candidate set. Furthermore, an effective combination strategy is adopted to find the PNN with the highest probability. The complexity analysis shows that our solution has strong advantages over existing methods. The efficiency of the proposed PNN-CT query processing is verified by extensive experiments based on real and synthetic trajectory data in road networks. Numéro de notice : A2012-107 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-011-0144-5 Date de publication en ligne : 15/10/2011 En ligne : https://doi.org/10.1007/s10707-011-0144-5 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31555 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2012031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Processing aggregated data: the location of clusters in health data / Kevin Buchin in Geoinformatica, vol 16 n° 3 (July 2012)  

Public [article]  inGeoinformatica > vol 16 n° 3 (July 2012) . - pp 197 - 521 Titre : Processing aggregated data: the location of clusters in health data Type de document : Article/Communication Auteurs : Kevin Buchin, Auteur ; M. Buchin, Auteur ; Marc Van Kreveld, Auteur ; et al., Auteur Année de publication : 2012 Article en page(s) : pp 197 - 521 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] agrégation spatiale [Termes IGN] base de données spatiotemporelles [Termes IGN] base de données thématiques [Termes IGN] géopositionnement [Termes IGN] regroupement de données [Termes IGN] santé Résumé : (Auteur) Spatially aggregated data is frequently used in geographical applications. Often spatial data analysis on aggregated data is performed in the same way as on exact data, which ignores the fact that we do not know the actual locations of the data. We here propose models and methods to take aggregation into account. For this we focus on the problem of locating clusters in aggregated data. More specifically, we study the problem of locating clusters in spatially aggregated health data. The data is given as a subdivision into regions with two values per region, the number of cases and the size of the population at risk. We formulate the problem as finding a placement of a cluster window of a given shape such that a cluster function depending on the population at risk and the cases is maximized. We propose area-based models to calculate the cases (and the population at risk) within a cluster window. These models are based on the areas of intersection of the cluster window with the regions of the subdivision. We show how to compute a subdivision such that within each cell of the subdivision the areas of intersection are simple functions. We evaluate experimentally how taking aggregation into account influences the location of the clusters found. Numéro de notice : A2012-108 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-011-0143-6 En ligne : https://doi.org/10.1007/s10707-011-0143-6 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31556 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2012031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

A framework for integrating multi-accuracy spatial data in geographical applications / Alberto Belussi in Geoinformatica, vol 16 n° 3 (July 2012)  

Public [article]  inGeoinformatica > vol 16 n° 3 (July 2012) . - pp 523 - 561 Titre : A framework for integrating multi-accuracy spatial data in geographical applications Type de document : Article/Communication Auteurs : Alberto Belussi, Auteur ; Sara Migliorini, Auteur Année de publication : 2012 Article en page(s) : pp 523 - 561 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] données multisources [Termes IGN] filtre de Kalman [Termes IGN] infrastructure nationale des données localisées [Termes IGN] intégration de données [Termes IGN] qualité des données Résumé : (Auteur) In recent years the integration of spatial data coming from different sources has become a crucial issue for many geographical applications, especially in the process of building and maintaining a Spatial Data Infrastructure (SDI). In such context new methodologies are necessary in order to acquire and update spatial datasets by collecting new measurements from different sources. The traditional approach implemented in GIS systems for updating spatial data does not usually consider the accuracy of these data, but just replaces the old geometries with the new ones. The application of such approach in the case of an SDI, where continuous and incremental updates occur, will lead very soon to an inconsistent spatial dataset with respect to spatial relations and relative distances among objects. This paper addresses such problem and proposes a framework for representing multi-accuracy spatial databases, based on a statistical representation of the objects geometry, together with a method for the incremental and consistent update of the objects, that applies a customized version of the Kalman filter. Moreover, the framework considers also the spatial relations among objects, since they represent a particular kind of observation that could be derived from geometries or be observed independently in the real world. Spatial relations among objects need also to be compared in spatial data integration and we show that they are necessary in order to obtain a correct result in merging objects geometries. Numéro de notice : A2012-109 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-011-0140-9 Date de publication en ligne : 20/10/2011 En ligne : https://doi.org/10.1007/s10707-011-0140-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31557 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2012031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

SKIF-P: a point-based indexing and ranking of web documents for spatial-keyword search / A. Khodaei in Geoinformatica, vol 16 n° 3 (July 2012)  

Public [article]  inGeoinformatica > vol 16 n° 3 (July 2012) . - pp 563 - 596 Titre : SKIF-P: a point-based indexing and ranking of web documents for spatial-keyword search Type de document : Article/Communication Auteurs : A. Khodaei, Auteur ; C. Shahabi, Auteur ; C. Li, Auteur Année de publication : 2012 Article en page(s) : pp 563 - 596 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] base de données localisées [Termes IGN] classement [Termes IGN] indexation documentaire Résumé : (Auteur) There is a significant commercial and research interest in location-based web search engines. Given a number of search keywords and one or more locations (geographical points) that a user is interested in, a location-based web search retrieves and ranks the most textually and spatially relevant web pages. In this type of search, both the spatial and textual information should be indexed. Currently, no efficient index structure exists that can handle both the spatial and textual aspects of data simultaneously and accurately. Existing approaches either index space and text separately or use inefficient hybrid index structures with poor performance and inaccurate results. Moreover, most of these approaches cannot accurately rank web-pages based on a combination of space and text and are not easy to integrate into existing search engines. In this paper, we propose a new index structure called Spatial-Keyword Inverted File for Points to handle point-based indexing of web documents in an integrated/efficient manner. To seamlessly find and rank relevant documents, we develop a new distance measure called spatial tf-idf. We propose four variants of spatial-keyword relevance scores and two algorithms to perform top-k searches. As verified by experiments, our proposed techniques outperform existing index structures in terms of search performance and accuracy. Numéro de notice : A2012-110 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-011-0142-7 Date de publication en ligne : 22/10/2011 En ligne : https://doi.org/10.1007/s10707-011-0142-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31558 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2012031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

A fuzzy index for detecting spatiotemporal outliers / George Grekousis in Geoinformatica, vol 16 n° 3 (July 2012)  

Public [article]  inGeoinformatica > vol 16 n° 3 (July 2012) . - pp 597 - 619 Titre : A fuzzy index for detecting spatiotemporal outliers Type de document : Article/Communication Auteurs : George Grekousis, Auteur ; Y. Fotis, Auteur Année de publication : 2012 Article en page(s) : pp 597 - 619 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] détection automatique [Termes IGN] indexation spatiale [Termes IGN] logique floue [Termes IGN] valeur aberrante Résumé : (Auteur) The detection of spatial outliers helps extract important and valuable information from large spatial datasets. Most of the existing work in outlier detection views the condition of being an outlier as a binary property. However, for many scenarios, it is more meaningful to assign a degree of being an outlier to each object. The temporal dimension should also be taken into consideration. In this paper, we formally introduce a new notion of spatial outliers. We discuss the spatiotemporal outlier detection problem, and we design a methodology to discover these outliers effectively. We introduce a new index called the fuzzy outlier index, Foi, which expresses the degree to which a spatial object belongs to a spatiotemporal neighbourhood. The proposed outlier detection method can be applied to phenomena evolving over time, such as moving objects, pedestrian modelling or credit card fraud. Numéro de notice : A2012-111 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-011-0145-4 Date de publication en ligne : 12/10/2011 En ligne : https://doi.org/10.1007/s10707-011-0145-4 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31559 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2012031	RAB	Revue	Centre de documentation	En réserve L003	Disponible