Revisiting Virtual Nodes in Graph Neural Networks for Link Prediction
It is well known that the graph classification performance of graph neural networks often improves by adding an artificial virtual node to the graphs, which is connected to all nodes in the graph. Intuitively, the virtual node provides a shortcut for message passing between nodes along the graph edges. Surprisingly, the impact of virtual nodes with other problems is still an open research question. In this paper, we adapt the concept of virtual nodes to the link prediction scenario, where we usually have much larger, often dense, and more heterogeneous graphs. In particular, we use multiple virtual nodes per graph and graph-based clustering to determine the connections to the graph nodes. We also investigate alternative clustering approaches (e.g., random or more advanced) and compare to the original model with a single virtual node. We conducted extensive experiments over different datasets of the Open Graph Benchmark (OGB) and analyze the results in detail. We show that our virtual node extensions yield rather stable performance increases and allow standard graph neural networks to compete with complex state-of-the-art models, as well as with the models leading the OGB leaderboards.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringGraph ClassificationLink PredictionSimilar Papers 제목 키워드 기반
Revisiting Graph Neural Networks for Link Prediction
Graph neural networks (GNNs) have achieved great success in recent years. Three most common applications include node classification, link prediction, and graph classification. While there is rich literature on node clas…
ClassificationGraph ClassificationLink PredictionNode Classification+1Revisiting Neighborhood-based Link Prediction for Collaborative Filtering
Collaborative filtering (CF) is one of the most successful and fundamental techniques in recommendation systems. In recent years, Graph Neural Network (GNN)-based CF models, such as NGCF [31], LightGCN [10] and GTN [9] h…
Collaborative FilteringGraph Neural NetworkLink PredictionPrediction+1Revisiting Node Affinity Prediction in Temporal Graphs
Node affinity prediction is a common task that is widely used in temporal graph learning with applications in social and financial networks, recommender systems, and more. Recent works have addressed this task by adaptin…
Link Property PredictionGraph LearningVirtual Nodes Improve Long-term Traffic Prediction
Effective traffic prediction is a cornerstone of intelligent transportation systems, enabling precise forecasts of traffic flow, speed, and congestion. While traditional spatio-temporal graph neural networks (ST-GNNs) ha…
PredictionTraffic PredictionRethinking the positive role of cluster structure in complex networks for link prediction tasks
Clustering is a fundamental problem in network analysis that finds closely connected groups of nodes and separates them from other nodes in the graph, while link prediction is to predict whether two nodes in a network ar…
ClusteringLink PredictionPrediction