Linking Streets in OpenStreetMap to Persons in Wikidata
- URL: http://arxiv.org/abs/2302.12907v1
- Date: Fri, 24 Feb 2023 21:35:53 GMT
- Title: Linking Streets in OpenStreetMap to Persons in Wikidata
- Authors: Daria Gurtovoy and Simon Gottschalk
- Abstract summary: Geographic web sources such as OpenStreetMap (OSM) and knowledge graphs such as Wikidata are often unconnected.
An example connection can be established between these sources are links between streets in OSM to the persons in Wikidata they were named after.
This paper presents StreetToPerson, an approach for connecting streets in OSM to persons in a knowledge graph based on relations in the knowledge graph and spatial dependencies.
- Score: 1.827510863075184
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Geographic web sources such as OpenStreetMap (OSM) and knowledge graphs such
as Wikidata are often unconnected. An example connection that can be
established between these sources are links between streets in OSM to the
persons in Wikidata they were named after. This paper presents StreetToPerson,
an approach for connecting streets in OSM to persons in a knowledge graph based
on relations in the knowledge graph and spatial dependencies. Our evaluation
shows that we outperform existing approaches by 26 percentage points. In
addition, we apply StreetToPerson on all OSM streets in Germany, for which we
identify more than 180,000 links between streets and persons.
Related papers
- Towards a Brazilian History Knowledge Graph [50.26735825937335]
We construct a knowledge graph for Brazilian history based on the Brazilian Dictionary of Historical Biographies (DHBB) and Wikipedia/Wikidata.
We show that many terms/entities described in the DHBB do not have corresponding concepts (or Q items) in Wikidata.
arXiv Detail & Related papers (2024-03-28T22:05:32Z) - Converting OpenStreetMap Data to Road Networks for Downstream
Applications [0.0]
OpenStreetMap data consist of nodes, ways, and relations.
We process OSM XML data to extract the information of nodes and ways to obtain the map of streets of the Memphis area.
arXiv Detail & Related papers (2022-11-22T17:46:56Z) - Leveraging Wikidata's edit history in knowledge graph refinement tasks [77.34726150561087]
edit history represents the process in which the community reaches some kind of fuzzy and distributed consensus.
We build a dataset containing the edit history of every instance from the 100 most important classes in Wikidata.
We propose and evaluate two new methods to leverage this edit history information in knowledge graph embedding models for type prediction tasks.
arXiv Detail & Related papers (2022-10-27T14:32:45Z) - Enriching Wikidata with Linked Open Data [4.311189028205597]
Current linked open data (LOD) tools are not suitable to enrich large graphs like Wikidata.
We present a novel workflow that includes gap detection, source selection, schema alignment, and semantic validation.
Our experiments show that our workflow can enrich Wikidata with millions of novel statements from external LOD sources with a high quality.
arXiv Detail & Related papers (2022-07-01T01:50:24Z) - Improving Candidate Retrieval with Entity Profile Generation for
Wikidata Entity Linking [76.00737707718795]
We propose a novel candidate retrieval paradigm based on entity profiling.
We use the profile to query the indexed search engine to retrieve candidate entities.
Our approach complements the traditional approach of using a Wikipedia anchor-text dictionary.
arXiv Detail & Related papers (2022-02-27T17:38:53Z) - Assessing the quality of sources in Wikidata across languages: a hybrid
approach [64.05097584373979]
We run a series of microtasks experiments to evaluate a large corpus of references, sampled from Wikidata triples with labels in several languages.
We use a consolidated, curated version of the crowdsourced assessments to train several machine learning models to scale up the analysis to the whole of Wikidata.
The findings help us ascertain the quality of references in Wikidata, and identify common challenges in defining and capturing the quality of user-generated multilingual structured data on the web.
arXiv Detail & Related papers (2021-09-20T10:06:46Z) - GeoVectors: A Linked Open Corpus of OpenStreetMap Embeddings on World
Scale [1.933681537640272]
This paper presents Geos - a unique, comprehensive world-scale linked corpus of OSM entity embeddings.
The Geos corpus captures semantic and geographic dimensions of OSM entities and makes them accessible to machine learning algorithms.
We provide a SPARQL endpoint - a semantic interface that offers direct access to semantic and latent representations of geographic entities in OSM.
arXiv Detail & Related papers (2021-08-30T10:00:34Z) - Towards Neural Schema Alignment for OpenStreetMap and Knowledge Graphs [0.966840768820136]
OpenStreetMap (OSM) is one of the richest openly available sources of volunteered geographic information.
Knowledge graphs can potentially provide valuable semantic information to enrich OSM entities.
This paper tackles the alignment of OSM tags with the corresponding knowledge graph classes holistically by jointly considering the schema and instance layers.
We propose a novel neural architecture that capitalizes upon a shared latent space for tag-to-class alignment created using linked entities in OSM and knowledge graphs.
arXiv Detail & Related papers (2021-07-28T10:40:35Z) - Linking OpenStreetMap with Knowledge Graphs -- Link Discovery for
Schema-Agnostic Volunteered Geographic Information [3.04585143845864]
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.
Our experiments conducted on several OSM datasets, as well as the Wikidata and DBpedia knowledge graphs, demonstrate that OSM2KG can reliably discover identity links.
arXiv Detail & Related papers (2020-11-06T19:03:41Z) - Grale: Designing Networks for Graph Learning [68.23038997141381]
We present Grale, a scalable method we have developed to address the problem of graph design for graphs with billions of nodes.
Grale operates by fusing together different measures of(potentially weak) similarity to create a graph which exhibits high task-specific homophily between its nodes.
We have deployed Grale in more than 20 different industrial settings at Google, including datasets which have tens of billions of nodes, and hundreds of trillions of potential edges to score.
arXiv Detail & Related papers (2020-07-23T13:25:36Z) - OpenStreetMap: Challenges and Opportunities in Machine Learning and
Remote Sensing [66.23463054467653]
We present a review of recent methods based on machine learning to improve and use OpenStreetMap data.
We believe that OSM can change the way we interpret remote sensing data and that the synergy with machine learning can scale participatory map making.
arXiv Detail & Related papers (2020-07-13T09:58:14Z)
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.