edgelist-mapper
📊 Maps nodes and edges of a multi-relational graph to integer
Synopsis
edgelist-mapper is a simple tool that reads an edge-list file representing a graph and maps each node and relation to integer. The mapping assigned is such that entities and relations that appear more frequently in the graph are mapped to smaller numerical values.
This tool is particularly useful to pre-process some of the publicly available knowledge graph datasets that are often used for the machine learning task of relation prediction.
Do you believe that this is useful?
Has it saved you time?
Or maybe you simply like it?
If so, support this work with a Star ⭐️.
Input format
The tool takes as input a file (edgelist.tsv) that represents a graph as tab-separated triples of the form (head, relation, tail) and generates three new files, namely mapped_edgelist.tsv, entities_map.tsv, and relations_map.tsv.
san_marino locatedin europe
belgium locatedin europe
russia locatedin europe
monaco locatedin europe
croatia locatedin europe
poland locatedin europe
Example content of the
edgelist.tsvfile.
0 europe
1 san_marino
2 russia
3 poland
4 monaco
5 croatia
6 belgium
Content of the
entities_map.tsvgenerated from theedgelist.tsvfile.
0 locatedin
Content of the
relations_map.tsvgenerated from theedgelist.tsvfile.
1 0 0
6 0 0
2 0 0
4 0 0
5 0 0
3 0 0
Content of the
mapped_edgelist.tsvgenerated from theedgelist.tsvfile.
CLI Usage
The CLI takes the following positional arguments:
edgelist Path of the edgelist file
output Path of the output directory
Example usage:
pip install edgelist-mapper
python -m edgelist_mapper.bin.run \
edgelist.tsv \
.NB: You need Python 3 to run the CLI.
Showcase
This tool has been used to create this collection of datasets.
Authors
- Simone Primarosa - simonepri
See also the list of contributors who participated in this project.
License
This project is licensed under the MIT License - see the license file for details.