A prime-number encoding of multi-relational graphs is extended with a lossless k-hop chaining algorithm and a Bag of Paths feature method that matches or beats GNN baselines on several benchmarks.
In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp 179--189
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis
A prime-number encoding of multi-relational graphs is extended with a lossless k-hop chaining algorithm and a Bag of Paths feature method that matches or beats GNN baselines on several benchmarks.