Weisfeiler-lehman neural machine for link prediction
In this paper, we propose a next-generation link prediction method, Weisfeiler-Lehman Neural Machine (Wlnm), which learns topological features in the form of graph patterns that promote the formation of links. Wlnm has unmatched advantages including higher performance than state-of-the-art methods and universal applicability over various kinds of networks. Wlnm extracts an enclosing subgraph of each target link and encodes the subgraph as an adjacency matrix. The key novelty of the encoding comes from a fast hashing-based Weisfeiler-Lehman (WL) algorithm that labels the vertices according to their structural roles in the subgraph while preserving the subgraph’s intrinsic directionality. After that, a neural network is trained on these adjacency matrices to learn a predictive model. Compared with traditional link prediction methods, Wlnm does not assume a particular link formation mechanism (such as common neighbors), but learns this mechanism from the graph itself. We conduct comprehensive experiments to show that Wlnm not only outperforms a great number of state-of-the-art link prediction methods, but also consistently performs well across networks with different characteristics.
Code (1)
Tasks
Link PredictionPredictionSimilar Papers 제목 키워드 기반
Two-Dimensional Weisfeiler-Lehman Graph Neural Networks for Link Prediction
Link prediction is one important application of graph neural networks (GNNs). Most existing GNNs for link prediction are based on one-dimensional Weisfeiler-Lehman (1-WL) test. 1-WL-GNNs first compute node representation…
Link PredictionVocal Bursts Valence PredictionBinarized Attributed Network Embedding
An implementation of "Binarized Attributed Network Embedding". Attributed network embedding enables joint representation learning of node links and attributes. Existing attributed network embedding models are designed in…
Graph EmbeddingLink PredictionNetwork EmbeddingNode Classification+1Expressive Higher-Order Link Prediction through Hypergraph Symmetry Breaking
A hypergraph consists of a set of nodes along with a collection of subsets of the nodes called hyperedges. Higher-order link prediction is the task of predicting the existence of a missing hyperedge in a hypergraph. A hy…
GPULink PredictionThe PWLR Graph Representation: A Persistent Weisfeiler-Lehman scheme with Random Walks for Graph Classification
This paper presents the Persistent Weisfeiler-Lehman Random walk scheme (abbreviated as PWLR) for graph representations, a novel mathematical framework which produces a collection of explainable low-dimensional represent…
Graph ClassificationWL-Align: Weisfeiler-Lehman Relabeling for Aligning Users across Networks via Regularized Representation Learning
Aligning users across networks using graph representation learning has been found effective where the alignment is accomplished in a low-dimensional embedding space. Yet, achieving highly precise alignment is still chall…
Graph Representation LearningRepresentation Learning