Pular para o conteúdo principal

GeoRDF2Vec - Spatial KGs (SKG)

GeoRDF2Vec – Learning Location-Aware Entity Representations in Knowledge Graphs

arXiv:2504.17099v1 [cs.LG] 23 Apr 2025 

Many large knowledge graphs not only encode relational information between entities but also capture the geographic geometries of some or all of these entities. Prominent knowledge graphs such as DBpedia [17], YAGO [24], and Wikidata [32] contain geographic information on entities like places and buildings. Additionally, dedicated geographic knowledge graphs, such as KnowWhereGraph [14], WorldKG [8], and OSMh3KG [3], explicitly model geographic relationships.

Exemplos de SKG

3. Böckling, M., Paulheim, H., Detzler, S.: A Planet Scale Spatial-Temporal Knowledge Graph Based On OpenStreetMap And H3 Grid. In: Geospatial Linked Data Workshop. arXiv (2024)

8. Dsouza, A., Tempelmeier, N., Yu, R., Gottschalk, S., Demidova, E.: WorldKG: A World-Scale Geographic Knowledge Graph. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management. pp. 4475–4484. ACM, Virtual Event Queensland Australia (Oct 2021). https://doi.org/10.1145/3459637.3482023

14. Janowicz, K., Hitzler, P., Li, W., et al.: Know, Know Where, KnowWhereGraph: A densely connected, cross-domain knowledge graph and geo-enrichment service stack for applications in environmental intelligence. AI Magazine 43(1), 30–39 (Mar 2022). https://doi.org/10.1002/aaai.1204

For geographical question answering, several models have been developed to generate spatially explicit KG embeddings. Unlike standard QA benchmark datasets, QA datasets that involve spatial data must account for additional constraints. One model that employs a specialized embedding approach for geographic data is TransGeo, an adaptation of TransE [19].

Tarefas com SKG: QA para Where

Mann et al. [20] address the challenge of predicting spatial links in geographic KGs, which are often sparsely interlinked. Traditional link prediction methods typically rely on existing entity relations, which may be missing in such KGs. To overcome this limitation, the authors propose two approaches:

Supervised Spatial Link Prediction (SSLP): This method leverages spatial and semantic embeddings derived from the literal values of geographic entities to predict links. 

Unsupervised Inductive Spatial Link Prediction (USLP): Unlike SSLP, this approach does not require labeled training data. Instead, it uses the haversine distance between geohash grid cell centroids to infer spatial links. 

The authors evaluate these methods using WorldKG, demonstrating that both SSLP and USLP outperform existing state-of-the-art link prediction techniques. Their results highlight the effectiveness of incorporating spatial and semantic embeddings to enhance the completeness of geographic knowledge graphs [20].

 Tarefas com SKG: Predição de links para nós espaciais. Será que poderiam ser usados para inferir contexto espacial inexistente?

In many public knowledge graphs, whether they model only spatial data or general information, spatial geometries are represented as literals within a KG. Our approach aims to leverage these geometries to model spatial relationships between individual nodes.

Novos relacionamentos entre os nós espaciais mas é baseado somente em distância

In a KG, each node can has a neighborhood. The neighborhood of a node v ∈ V is defined as H(v) := {(s, p, o) : ∃p, o|(v, p, o) ∈ E}∪{(s, p, o) : ∃s, p|(s, p, v) ∈ E}. The set of neighbors N(v) of a node v ∈ V is defined as N(v) := {v′ : ∃r|(v, r, v′) ∈ H(v) ∨ (v′, r, v) ∈ H(v)}. Geometries can be points, lines, polygons, multipoints, multilines, multipolygons and geometry collections. We define a spatial knowledge graph SKG as a knowledge graph where a part of the nodes has a geometry attached, i.e.,
SKG = (V,E, S), where S ⊆ V × G is the set of nodes that have a geometry attached, and G is the (theoretically infinite) set of all possible geometries. The subset GV ⊆ V of geographic nodes is the set of nodes which have at least one geometry, i.e., GV := {v ∈ V |∃g : (v, g) ∈ S}. We further distinguish fully spatial KGs as those KGs where every node has a geometry attached (i.e., V = GV ), and partially spatial KGs where some, but not all nodes have a geometry attached (GV ⊂ V ). The majority of common knowledge graphs, such as DBpedia or Wikidata, are partially geographic KGs.

 Definição de SKG

GeoSPARQL has been introduced as a standard for geographical representation in KGs. It defines six classes and 36 object properties. The superclass of GeoSPARQL is named SpatialObject, which represents spatial entities and includes two primary subclasses: Feature and Geometry. 

Linguagem de manipulação: extensão do SPARQL para este tipo de dados

3.2 From Spatial Distances to Edge Weights

Não são uma Algebra de Contradominio, são calculos de distância



Comentários

Postagens mais visitadas deste blog

Connected Papers: Uma abordagem alternativa para revisão da literatura

Durante um projeto de pesquisa podemos encontrar um artigo que nos identificamos em termos de problema de pesquisa e também de solução. Então surge a vontade de saber como essa área de pesquisa se desenvolveu até chegar a esse ponto ou quais desdobramentos ocorreram a partir dessa solução proposta para identificar o estado da arte nesse tema. Podemos seguir duas abordagens:  realizar uma revisão sistemática usando palavras chaves que melhor caracterizam o tema em bibliotecas digitais de referência para encontrar artigos relacionados ou realizar snowballing ancorado nesse artigo que identificamos previamente, explorando os artigos citados (backward) ou os artigos que o citam (forward)  Mas a ferramenta Connected Papers propõe uma abordagem alternativa para essa busca. O problema inicial é dado um artigo de interesse, precisamos encontrar outros artigos relacionados de "certa forma". Find different methods and approaches to the same subject Track down the state of the art rese...

Knowledge Graphs as a source of trust for LLM-powered enterprise question answering - Leitura de Artigo

J. Sequeda, D. Allemang and B. Jacob, Knowledge Graphs as a source of trust for LLM-powered enterprise question answering, Web Semantics: Science, Services and Agents on the World Wide Web (2025), doi: https://doi.org/10.1016/j.websem.2024.100858. 1. Introduction These question answering systems that enable to chat with your structured data hold tremendous potential for transforming the way self service and data-driven decision making is executed within enterprises. Self service and data-driven decision making in organizations today is largly made through Business Intelligence (BI) and analytics reporting. Data teams gather the original data, integrate the data, build a SQL data warehouse (i.e. star schemas), and create BI dashboards and reports that are then used by business users and analysts to answer specific questions (i.e. metrics, KPIs) and make decisions. The bottleneck of this approach is that business users are only able to answer questions given the views of existing dashboa...

Knowledge Graph Toolkit (KGTK)

https://kgtk.readthedocs.io/en/latest/ KGTK represents KGs using TSV files with 4 columns labeled id, node1, label and node2. The id column is a symbol representing an identifier of an edge, corresponding to the orange circles in the diagram above. node1 represents the source of the edge, node2 represents the destination of the edge, and label represents the relation between node1 and node2. >> Quad do RDF, definir cada tripla como um grafo   KGTK defines knowledge graphs (or more generally any attributed graph or hypergraph ) as a set of nodes and a set of edges between those nodes. KGTK represents everything of meaning via an edge. Edges themselves can be attributed by having edges asserted about them, thus, KGTK can in fact represent arbitrary hypergraphs. KGTK intentionally does not distinguish attributes or qualifiers on nodes and edges from full-fledged edges, tools operating on KGTK graphs can instead interpret edges differently if they so desire. In KGTK, e...