paper-with-me

홈 › Papers

A Theory of Link Prediction via Relational Weisfeiler-Leman on Knowledge Graphs

2023-02-04 · NeurIPS 2023 11 · Xingyue Huang, Miguel Romero Orth, İsmail İlkan Ceylan, Pablo Barceló

Graph neural networks are prominent models for representation learning over graph-structured data. While the capabilities and limitations of these models are well-understood for simple graphs, our understanding remains incomplete in the context of knowledge graphs. Our goal is to provide a systematic understanding of the landscape of graph neural networks for knowledge graphs pertaining to the prominent task of link prediction. Our analysis entails a unifying perspective on seemingly unrelated models and unlocks a series of other models. The expressive power of various models is characterized via a corresponding relational Weisfeiler-Leman algorithm. This analysis is extended to provide a precise logical characterization of the class of functions captured by a class of graph neural networks. The theoretical findings presented in this paper explain the benefits of some widely employed practical design choices, which are validated empirically.

📄 PDF Abstract BibTeX arXiv:2302.02209

Code (1)

hxyscotthuang/cmpnn 공식 구현 pytorch

Tasks

Knowledge GraphsLink PredictionRepresentation Learning

Similar Papers 제목 키워드 기반

Link Prediction with Relational Hypergraphs

2024-02-06 · Xingyue Huang, Miguel Romero Orth, Pablo Barceló, Michael M. Bronstein 외

Link prediction with knowledge graphs has been thoroughly studied in graph machine learning, leading to a rich landscape of graph neural network architectures with successful applications. Nonetheless, it remains challen…

Graph Neural NetworkInductive Link PredictionKnowledge GraphsLink Prediction+1

The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs

2021-05-12 · Christopher Morris, Matthias Fey, Nils M. Kriege

In recent years, algorithms and neural architectures based on the Weisfeiler-Leman algorithm, a well-known heuristic for the graph isomorphism problem, emerged as a powerful tool for (supervised) machine learning with gr…

BIG-bench Machine LearningNode Classification

Weisfeiler and Leman go Machine Learning: The Story so far

2021-12-18 · Christopher Morris, Yaron Lipman, Haggai Maron, Bastian Rieck 외

In recent years, algorithms and neural architectures based on the Weisfeiler--Leman algorithm, a well-known heuristic for the graph isomorphism problem, have emerged as a powerful tool for machine learning with graphs an…

BIG-bench Machine LearningRepresentation Learning

Weisfeiler and Leman Go Relational

2022-11-30 · Pablo Barcelo, Mikhail Galkin, Christopher Morris, Miguel Romero Orth

Knowledge graphs, modeling multi-relational data, improve numerous applications such as question answering or graph logical reasoning. Many graph neural networks for such data emerged recently, often outperforming shallo…

Knowledge GraphsLogical ReasoningQuestion Answering

Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited

2022-05-22 · Nils M. Kriege

Random walk kernels have been introduced in seminal work on graph learning and were later largely superseded by kernels based on the Weisfeiler-Leman test for graph isomorphism. We give a unified view on both classes of …

Graph Learning