View publication
| Title | Global Vertex Similarity for Large-Scale Knowledge Graphs |
| Authors | Marco Caballero, Aidan Hogan |
| Publication date | 2020 |
| Abstract | We investigate global measures of vertex similarity for knowledge graphs. While vertex similarity has been explored in the context of directed, unlabelled graphs, measures based on recursive algorithms or learning frameworks can be costly to compute, assume labelled data, and/or provide poorly-interpretable results. Knowledge graphs further imply unique challenges for vertex similarity in terms of scale and diversity. We thus propose and explore global measures of vertex similarity for Knowledge Graphs that (i) are unsupervised, (ii) offer explanations of similarity results; (iii) take into consideration edge labels; and (iv) are robust in terms of redundant or interdependent information. Given that these measures can still be costly to compute precisely, we propose an approximation strategy that enables computation at scale. We compare our measures with a recursive measure (SimRank) for computing vertex similarity over subsets of Wikidata. |
| Pages | paper 16 |
| Conference name | Wikidata Workshop |
| Publisher | CEUR Publications |
| Reference URL |
|