Linking OpenStreetMap with knowledge graphs: Link discovery for schema-agnostic volunteered geographic information

Research output: Contribution to journalArticleResearchpeer review

Authors

  • Nicolas Tempelmeier
  • Elena Demidova

Research Organisations

External Research Organisations

  • University of Bonn
View graph of relations

Details

Original languageEnglish
Pages (from-to)349-364
Number of pages16
JournalFuture generation computer systems
Volume116
Early online date17 Nov 2020
Publication statusPublished - Mar 2021

Abstract

Representations of geographic entities captured in popular knowledge graphs such as Wikidata and DBpedia are often incomplete. OpenStreetMap (OSM) is a rich source of openly available, volunteered geographic information that has a high potential to complement these representations. However, identity links between the knowledge graph entities and OSM nodes are still rare. The problem of link discovery in these settings is particularly challenging due to the lack of a strict schema and heterogeneity of the user-defined node representations in OSM. In this article, we propose OSM2KG - a novel link discovery approach to predict identity links between OSM nodes and geographic entities in a knowledge graph. The core of the OSM2KG approach is a novel latent, compact representation of OSM nodes that captures semantic node similarity in an embedding. OSM2KG adopts this latent representation to train a supervised model for link prediction and utilises existing links between OSM and knowledge graphs for training. Our experiments conducted on several OSM datasets, as well as the Wikidata and DBpedia knowledge graphs, demonstrate that OSM2KG can reliably discover identity links. OSM2KG achieves an F1 score of 92.05% on Wikidata and of 94.17% on DBpedia on average, which corresponds to a 21.82 percentage points increase in F1 score on Wikidata compared to the best performing baselines.

ASJC Scopus subject areas

Cite this

Linking OpenStreetMap with knowledge graphs: Link discovery for schema-agnostic volunteered geographic information. / Tempelmeier, Nicolas; Demidova, Elena.
In: Future generation computer systems, Vol. 116, 03.2021, p. 349-364.

Research output: Contribution to journalArticleResearchpeer review

Tempelmeier N, Demidova E. Linking OpenStreetMap with knowledge graphs: Link discovery for schema-agnostic volunteered geographic information. Future generation computer systems. 2021 Mar;116:349-364. Epub 2020 Nov 17. doi: 10.1016/j.future.2020.11.003
Download
@article{42431c7bc36948a3884beabb810a4f33,
title = "Linking OpenStreetMap with knowledge graphs: Link discovery for schema-agnostic volunteered geographic information",
abstract = "Representations of geographic entities captured in popular knowledge graphs such as Wikidata and DBpedia are often incomplete. OpenStreetMap (OSM) is a rich source of openly available, volunteered geographic information that has a high potential to complement these representations. However, identity links between the knowledge graph entities and OSM nodes are still rare. The problem of link discovery in these settings is particularly challenging due to the lack of a strict schema and heterogeneity of the user-defined node representations in OSM. In this article, we propose OSM2KG - a novel link discovery approach to predict identity links between OSM nodes and geographic entities in a knowledge graph. The core of the OSM2KG approach is a novel latent, compact representation of OSM nodes that captures semantic node similarity in an embedding. OSM2KG adopts this latent representation to train a supervised model for link prediction and utilises existing links between OSM and knowledge graphs for training. Our experiments conducted on several OSM datasets, as well as the Wikidata and DBpedia knowledge graphs, demonstrate that OSM2KG can reliably discover identity links. OSM2KG achieves an F1 score of 92.05% on Wikidata and of 94.17% on DBpedia on average, which corresponds to a 21.82 percentage points increase in F1 score on Wikidata compared to the best performing baselines.",
author = "Nicolas Tempelmeier and Elena Demidova",
note = "Funding Information: This work is partially funded by the DFG, German Research Foundation (“WorldKG”, DE 2299/2-1 , 424985896 ), the Federal Ministry of Education and Research (BMBF) , Germany (“Simple-ML”, 01IS18054 ), (“Data4UrbanMobility”, 02K15A040 ), and the Federal Ministry for Economic Affairs and Energy (BMWi) , Germany (“d-E-mand”, 01ME19009B ). ",
year = "2021",
month = mar,
doi = "10.1016/j.future.2020.11.003",
language = "English",
volume = "116",
pages = "349--364",
journal = "Future generation computer systems",
issn = "0167-739X",
publisher = "Elsevier",

}

Download

TY - JOUR

T1 - Linking OpenStreetMap with knowledge graphs

T2 - Link discovery for schema-agnostic volunteered geographic information

AU - Tempelmeier, Nicolas

AU - Demidova, Elena

N1 - Funding Information: This work is partially funded by the DFG, German Research Foundation (“WorldKG”, DE 2299/2-1 , 424985896 ), the Federal Ministry of Education and Research (BMBF) , Germany (“Simple-ML”, 01IS18054 ), (“Data4UrbanMobility”, 02K15A040 ), and the Federal Ministry for Economic Affairs and Energy (BMWi) , Germany (“d-E-mand”, 01ME19009B ).

PY - 2021/3

Y1 - 2021/3

N2 - Representations of geographic entities captured in popular knowledge graphs such as Wikidata and DBpedia are often incomplete. OpenStreetMap (OSM) is a rich source of openly available, volunteered geographic information that has a high potential to complement these representations. However, identity links between the knowledge graph entities and OSM nodes are still rare. The problem of link discovery in these settings is particularly challenging due to the lack of a strict schema and heterogeneity of the user-defined node representations in OSM. In this article, we propose OSM2KG - a novel link discovery approach to predict identity links between OSM nodes and geographic entities in a knowledge graph. The core of the OSM2KG approach is a novel latent, compact representation of OSM nodes that captures semantic node similarity in an embedding. OSM2KG adopts this latent representation to train a supervised model for link prediction and utilises existing links between OSM and knowledge graphs for training. Our experiments conducted on several OSM datasets, as well as the Wikidata and DBpedia knowledge graphs, demonstrate that OSM2KG can reliably discover identity links. OSM2KG achieves an F1 score of 92.05% on Wikidata and of 94.17% on DBpedia on average, which corresponds to a 21.82 percentage points increase in F1 score on Wikidata compared to the best performing baselines.

AB - Representations of geographic entities captured in popular knowledge graphs such as Wikidata and DBpedia are often incomplete. OpenStreetMap (OSM) is a rich source of openly available, volunteered geographic information that has a high potential to complement these representations. However, identity links between the knowledge graph entities and OSM nodes are still rare. The problem of link discovery in these settings is particularly challenging due to the lack of a strict schema and heterogeneity of the user-defined node representations in OSM. In this article, we propose OSM2KG - a novel link discovery approach to predict identity links between OSM nodes and geographic entities in a knowledge graph. The core of the OSM2KG approach is a novel latent, compact representation of OSM nodes that captures semantic node similarity in an embedding. OSM2KG adopts this latent representation to train a supervised model for link prediction and utilises existing links between OSM and knowledge graphs for training. Our experiments conducted on several OSM datasets, as well as the Wikidata and DBpedia knowledge graphs, demonstrate that OSM2KG can reliably discover identity links. OSM2KG achieves an F1 score of 92.05% on Wikidata and of 94.17% on DBpedia on average, which corresponds to a 21.82 percentage points increase in F1 score on Wikidata compared to the best performing baselines.

UR - http://www.scopus.com/inward/record.url?scp=85096713896&partnerID=8YFLogxK

U2 - 10.1016/j.future.2020.11.003

DO - 10.1016/j.future.2020.11.003

M3 - Article

AN - SCOPUS:85096713896

VL - 116

SP - 349

EP - 364

JO - Future generation computer systems

JF - Future generation computer systems

SN - 0167-739X

ER -