Towards Neural Schema Alignment forOpenStreetMap and Knowledge Graphs

This repository contains the manually generated ground truth and implementation codes for the paper Towards Neural Schema Alignment forOpenStreetMap and Knowledge Graphs.

Descriptions:

Steps to obtain tag-to-class matches:

1. Download specific OSM data from https://download.geofabrik.de/
2. Create osmTagKeyWiki.csv and osmKeyWiki.csv files. These files contain the linked tags and keys from wikidata knowledge graph.
3. Run osm_2_rdf.py to get the data in RDF format for further processing. 1st argument is the downloaded geofabrik file and 2nd argument is the file name in which you want to save the rdf triples. example command: python osm_2_rdf.py italy-latest.osm.pbf italyRDFWikidata.txt
4. Run script readRDFWikidata.py or readRDFDBpedia.py to get the one-hot encoded OSM and KG data. 1st argument is triples file generated from previous script 2nd argument is the new .csv file in which the OSM and KG data will be stored. example command: python readRDFWikidata.py italyRDFWikidata.txt italyWikidata.csv
5. Run script schemaMatch.py to get the list which matches generated by the model. 1st argument is .csv file generated from previous script. 2nd argument is the new .csv file which will store the matches and 3rd argument is the activation threshold value. example command: python schemaMatch.py italyWikidata.csv italyWikidataMatches.csv 0.35

Folder Descriptions:

Scripts: Contains scripts to run NCA approach and also scripts for baselines.

Reference:

If you find our work useful in your research please consider citing our paper.

@inproceedings{dsouza2021towards,
   title={{Towards Neural Schema Alignment for OpenStreetMap and Knowledge Graphs}},
   author={Dsouza, Alishiba and Tempelmeier, Nicolas and Demidova, Elena},
   booktitle={Proceedings of the 20th International Semantic Web Conference, {ISWC} 2021 },
   series={Lecture Notes in Computer Science},
   volume={12922},
   pages={56--73},
   year={2021},
   organization={Springer},
   doi={10.1007/978-3-030-88361-4\_4}
}