A Planet Scale Spatial-Temporal Knowledge Graph Based On OpenStreetMap And H3 Grid

• URL: http://arxiv.org/abs/2405.15375v1
• Date: Fri, 24 May 2024 09:22:20 GMT
• Title: A Planet Scale Spatial-Temporal Knowledge Graph Based On OpenStreetMap And H3 Grid
• Authors: Martin Böckling, Heiko Paulheim, Sarah Detzler,
• Abstract summary: We propose a framework which supports a planet scale transformation of OpenStreetMap data into a Spatial Temporal Knowledge Graph. In addition to OpenStreetMap data, we align the different OpenStreetMap on individual h3 grid cells.
• Score: 1.6658912537684454
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Geospatial data plays a central role in modeling our world, for which OpenStreetMap (OSM) provides a rich source of such data. While often spatial data is represented in a tabular format, a graph based representation provides the possibility to interconnect entities which would have been separated in a tabular representation. We propose in our paper a framework which supports a planet scale transformation of OpenStreetMap data into a Spatial Temporal Knowledge Graph. In addition to OpenStreetMap data, we align the different OpenStreetMap geometries on individual h3 grid cells. We compare our constructed spatial knowledge graph to other spatial knowledge graphs and outline our contribution in this paper. As a basis for our computation, we use Apache Sedona as a computational framework for our Spatial Temporal Knowledge Graph construction

Related papers

• GraphEdit: Large Language Models for Graph Structure Learning [62.618818029177355]
  Graph Structure Learning (GSL) focuses on capturing intrinsic dependencies and interactions among nodes in graph-structured data. Existing GSL methods heavily depend on explicit graph structural information as supervision signals. We propose GraphEdit, an approach that leverages large language models (LLMs) to learn complex node relationships in graph-structured data.
  arXiv  Detail & Related papers  (2024-02-23T08:29:42Z)
• Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
  This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data. The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
  arXiv  Detail & Related papers  (2024-01-12T17:57:07Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• SGAligner : 3D Scene Alignment with Scene Graphs [84.01002998166145]
  Building 3D scene graphs has emerged as a topic in scene representation for several embodied AI applications. We focus on the fundamental problem of aligning pairs of 3D scene graphs whose overlap can range from zero to partial. We propose SGAligner, the first method for aligning pairs of 3D scene graphs that is robust to in-the-wild scenarios.
  arXiv  Detail & Related papers  (2023-04-28T14:39:22Z)
• highway2vec -- representing OpenStreetMap microregions with respect to their road network characteristics [3.5960954499553512]
  We propose a method for generating microregions' embeddings with respect to road infrastructure characteristics. We base our representations on OpenStreetMap road networks in a selection of cities. We obtained vector representations that detect how similar map hexagons are in the road networks they contain.
  arXiv  Detail & Related papers  (2023-04-26T23:16:18Z)
• Hierarchical Graph Structures for Congestion and ETA Prediction [0.0]
  Traffic4cast is an annual competition to predict temporal traffic based on real world data. We propose an approach using Neural Networks that directly works on the road graph topology which was extracted from OpenStreetMap data. Our architecture can incorporate a hierarchical graph representation to improve the information flow between key intersections of the graph and the shortest paths connecting them.
  arXiv  Detail & Related papers  (2022-11-21T15:35:27Z)
• PolarMOT: How Far Can Geometric Relations Take Us in 3D Multi-Object Tracking? [62.997667081978825]
  We encode 3D detections as nodes in a graph, where spatial and temporal pairwise relations among objects are encoded via localized polar coordinates on graph edges. This allows our graph neural network to learn to effectively encode temporal and spatial interactions. We establish a new state-of-the-art on nuScenes dataset and, more importantly, show that our method, PolarMOT, generalizes remarkably well across different locations.
  arXiv  Detail & Related papers  (2022-08-03T10:06:56Z)
• GANmapper: geographical content filling [0.0]
  We present a new method to create spatial data using a generative adversarial network (GAN) Our contribution uses coarse and widely available geospatial data to create maps of less available features at the finer scale in the built environment. We employ land use data and road networks as input to generate building footprints, and conduct experiments in 9 cities around the world.
  arXiv  Detail & Related papers  (2021-08-07T05:50:54Z)
• Hippocampal Spatial Mapping As Fast Graph Learning [0.0]
  The hippocampal formation is thought to learn spatial maps of environments, and in many models this learning process consists of forming a sensory association for each location in the environment. In this work, I approach spatial mapping as a problem of learning graphs of environment parts. Each node in the learned graph, represented by hippocampal engram cells, is associated with feature information in lateral entorhinal cortex (LEC) and location information in medial entorhinal cortex (MEC) using empirically observed neuron types. This core idea of associating arbitrary information with nodes and edges is not inherently spatial, so this proposed fast-
  arXiv  Detail & Related papers  (2021-07-01T16:05:42Z)
• COLOGNE: Coordinated Local Graph Neighborhood Sampling [1.6498361958317633]
  replacing discrete unordered objects such as graph nodes by real-valued vectors is at the heart of many approaches to learning from graph data. We address the problem of learning discrete node embeddings such that the coordinates of the node vector representations are graph nodes. This opens the door to designing interpretable machine learning algorithms for graphs as all attributes originally present in the nodes are preserved.
  arXiv  Detail & Related papers  (2021-02-09T11:39:06Z)
• node2coords: Graph Representation Learning with Wasserstein Barycenters [59.07120857271367]
  We introduce node2coords, a representation learning algorithm for graphs. It learns simultaneously a low-dimensional space and coordinates for the nodes in that space. Experimental results demonstrate that the representations learned with node2coords are interpretable.
  arXiv  Detail & Related papers  (2020-07-31T13:14:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.