Détail de l'éditeur
Documents disponibles chez cet éditeur (377)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
3D shape histograms for similarity search and classification in spatial databases / M. Ankerst (20/07/1999)
contenu dans
Titre : 3D shape histograms for similarity search and classification in spatial databases Type de document : Article/Communication Auteurs : M. Ankerst, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 20/07/1999 Conférence : SSD 1999, 6th International Symposium Advances in spatial data bases 20/07/1999 23/07/1999 Hong Kong Chine Proceedings Springer Importance : pp 207 - 226 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] classification barycentrique
[Termes IGN] exploration de données géographiques
[Termes IGN] forme quadratique
[Termes IGN] histogramme
[Termes IGN] requête spatiale
[Termes IGN] similitudeRésumé : (Auteur) Classification is one of the basic tasks of data mining in modem database applications including molecular biology, astronomy, mechanical engineering, medical imaging or meteorology. The underlying models have to consider spatial properties such as shape or extension as well as thematic attributes. We introduce 3D shape histograms as an intuitive and powerful similarity model for 3D objects. Particular flexibility is provided by using quadratic form distance functions in order to account for errors of measurement, sampling, and numerical rounding that all may result in small displacements and rotations of shapes. For query processing, a general filter-refinement architecture is employed that efficiently supports similarity search based on quadratic forms. An experimental evaluation in the context of molecular biology demonstrates both, the high classification accuracy of more than 90% and the good performance of the approach. Numéro de notice : C1999-059 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Communication DOI : 10.1007/3-540-48482-5_14 En ligne : https://doi.org/10.1007/3-540-48482-5_14 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=65825
contenu dans Advances in spatial data bases, SSD '99, 6th International Symposium, Hong Kong, China, July 20-23, 1999 / Ralf Hartmut Güting (1999)
Titre : Algorithms for joining R-trees and linear region quadtrees Type de document : Article/Communication Auteurs : A. Corral, Auteur ; M. Vassilakopoulos, Auteur ; Y. Manolopoulos, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 20/07/1999 Conférence : SSD 1999, 6th International Symposium Advances in spatial data bases 20/07/1999 23/07/1999 Hong Kong Chine Proceedings Springer Importance : pp 251 - 269 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] accès aux données localisées
[Termes IGN] arbre quadratique
[Termes IGN] arbre-R
[Termes IGN] base de données localisées
[Termes IGN] jointure spatiale
[Termes IGN] requête spatialeRésumé : (Auteur) The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are suitable for storing 2-dimensional regional data and their linear variant is used in many Geographical Information Systems for this purpose. In this report, we present five algorithms suitable for processing join queries between these two successful, although very different, access methods. Two of the algorithms axe based on heuristics that aim at minimizing I/O cost with a limited amount of main memory. We also present the results of experiments performed with real data that compare the I/O performance of these algorithms. Numéro de notice : C1999-060 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Communication DOI : 10.1007/3-540-48482-5_16 En ligne : https://doi.org/10.1007/3-540-48482-5_16 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=65826 Efficient polygon amalgamation methods for spatial OLAP and spatial data mining / X. Zhou (20/07/1999)
contenu dans Advances in spatial data bases, SSD '99, 6th International Symposium, Hong Kong, China, July 20-23, 1999 / Ralf Hartmut Güting (1999)
Titre : Efficient polygon amalgamation methods for spatial OLAP and spatial data mining Type de document : Article/Communication Auteurs : X. Zhou, Auteur ; D. Truffet, Auteur ; Jiawei Han, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 20/07/1999 Conférence : SSD 1999, 6th International Symposium Advances in spatial data bases 20/07/1999 23/07/1999 Hong Kong Chine Proceedings Springer Importance : pp 167 - 187 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] exploration de données géographiques
[Termes IGN] indexation spatiale
[Termes IGN] OLAP
[Termes IGN] polygone
[Termes IGN] regroupement de données
[Termes IGN] requête spatiale
[Termes IGN] SOLAPRésumé : (Auteur) The polygon amalgamation operation computes the boundary of the union of a set of polygons. This is an important operation for spatial on-line analytical processing and spatial data mining, where polygons representing different spatial objects often need to be amalgamated by varying criteria when the user wants to aggregate or reclassify these objects. The processing cost of this operation can be very high for a large number of polygons. Based on the observation that not all polygons to be amalgamated contribute to the boundary, we investigate in this paper efficient polygon amalgamation methods by excluding those internal polygons without retrieving them from the database. Two novel algorithms, adjacency-based and occupancy-based, are proposed. While both algorithms can reduce the amalgamation cost significantly, the occupancy-based algorithm is particularly attractive because : 1) it retrieves a smaller amount of data than the adjacency-based algorithm ; 2) it is based on a simple extension to a commonly used spatial indexing mechanism ; and 3) it can handle fuzzy amalgamation. Numéro de notice : C1999-058 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Communication DOI : 10.1007/3-540-48482-5_12 En ligne : https://doi.org/10.1007/3-540-48482-5_12 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=65824
contenu dans Advances in spatial data bases, SSD '99, 6th International Symposium, Hong Kong, China, July 20-23, 1999 / Ralf Hartmut Güting (1999)
Titre : GBI : a generalized R-tree bulk-insertion strategy Type de document : Article/Communication Auteurs : R. Choubey, Auteur ; L. Chen, Auteur ; E.A. Rundensteiner, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 20/07/1999 Collection : Lecture notes in Computer Science, ISSN 0302-9743 num. 1651 Conférence : SSD 1999, 6th International Symposium Advances in spatial data bases 20/07/1999 23/07/1999 Hong Kong Chine Proceedings Springer Importance : pp 91 - 108 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] arbre-R
[Termes IGN] groupe
[Termes IGN] index spatial
[Termes IGN] indexation spatiale
[Termes IGN] requête spatialeRésumé : (Auteur) A lot of recent work has studied strategies related to bulk loading of large data sets into multidimensional index structures. In this paper, we address the problem of bulk insertions into existing index structures with particular focus on R-trees - which are an important class of index structures used widely in commercial database systems. We propose a new technique, which as opposed to the current technique of inserting data one by one, bulk inserts entire new incoming datasets into an active R-tree. This technique, called GBI (for Generalized Bulk Insertion), partitions the new datasets into sets of clusters and outliers, constructs an R-tree (small tree) from each cluster, identifies and prepares suitable locations in the original R.-tree (large tree) for insertion, and lastly performs the insertions of the small trees and the outliers into the large tree in bulk. Our experimental studies demonstrate that GBI does especially well (over 200% better than the existing technique) for randomly located data as well as for real datasets that contain few natural clusters, while also consistently outperforming the alternate technique in all other circumstances. Numéro de notice : C1999-057 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Communication DOI : 10.1007/3-540-48482-5_8 En ligne : https://doi.org/10.1007/3-540-48482-5_8 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=65823
Titre : Generalizing graphs using amalgamation and selection Type de document : Article/Communication Auteurs : J.G. Stell, Auteur ; Michael F. Worboys, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 20/07/1999 Conférence : SSD 1999, 6th International Symposium Advances in spatial data bases 20/07/1999 23/07/1999 Hong Kong Chine Proceedings Springer Importance : pp 19 - 32 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] généralisation automatique de données
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] graphe
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] objet géographique
[Termes IGN] regroupement de données
[Termes IGN] structure de données localisées
[Termes IGN] tri (informatique)Résumé : (Auteur) This work is a contribution to the developing literature on multi-resolution data models. It considers operations for model-oriented generalization in the case where the underlying data is structured as a graph. The paper presents a new approach in that a distinction is made between generalizations that amalgamate data objects and those that select data objects. We show that these two types of generalization are conceptually distinct, and provide a formal framework in which both can be understood. Generalizations that are combinations of amalgamation and selection are termed simplifications, and the paper provides a formal framework in which simplifications can be computed (for example, as compositions of other simplifications). A detailed case study is presented to illustrate the techniques developed, and directions for further work are discussed. Numéro de notice : C1999-056 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Communication DOI : 10.1007/3-540-48482-5_4 En ligne : https://doi.org/10.1007/3-540-48482-5_4 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=65822 Reconstruction of building models from maps and laser altimeter data / Uwe Stilla (14/06/1999)PermalinkAdvances in spatial data bases, SSD '99, 6th International Symposium, Hong Kong, China, July 20-23, 1999 / Ralf Hartmut Güting (1999)PermalinkPermalinkDiscrete Geometry for Computer Imagery, 8th International Conference, DGCI'99, Marne-la-Vallée, France, March 1999 / Gilles Bertrand (1999)PermalinkIntegrated spatial data bases / Peggy Agouris (1999)PermalinkInteroperating Geographic Information Systems, Second International Workshop, Interop '99, Zurich, Switzerland, March 10-12 1999 / Andrej Vckovski (1999)PermalinkPermalinkSpatial information theory, cognitive and computational foundations of Geographic Information Science, / C. Freksa (1999)PermalinkUncertainty management for spatial data in databases: fuzzy spatial data types / Markus Schneider (1999)PermalinkPermalinkPermalinkSpatial cognition, an interdisciplinary approach to representing and processing spatial knowledge / Christian Freksa (1998)PermalinkTheory of orbits, 2. Volume 2 Perturbative and geometrical methods / D. Boccaletti (1998)PermalinkAdvances in spatial data bases, 5th International Symposium, SSD '97, Berlin, Germany, July 15-18 1997 / Agnès Voisard (1997)PermalinkPermalinkMatrix analysis / R. Bhatia (1997)PermalinkPractical geodesy / M. Hooijberg (1997)PermalinkPermalinkTopographic maps automatic interpretation : some proposed strategies / Marc Pierrot-Deseilligny (1997)PermalinkVoronoï diagrams on line segments: Measurements for contextual generalization purposes / Jean-François Hangouët (1997)Permalink