Introducing New Node Prediction in Graph Mining: Predicting All Links from Isolated Nodes with Graph Neural Networks
원문 초록
This paper introduces a new problem in the field of graph mining and social network analysis called new node prediction. More technically, the task can be categorized as zero-shot out-of-graph all-links prediction. This challenging problem aims to predict all links from a new, isolated, and unobserved node that was previously disconnected from the graph. Unlike classic approaches to link prediction (including few-shot out-of-graph link prediction), this problem presents two key differences: (1) the new node has no existing links from which to extract patterns for new predictions; and (2) the goal is to predict not just one, but all the links of this new node, or at least a significant part of them. Experiments demonstrate that an architecture based on Deep Graph Neural Networks can learn to solve this challenging problem in a bibliographic citation network.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
Learnable Spatial-Temporal Positional Encoding for Link Prediction
Future Link Prediction Without Memory or Aggregation
Understanding Generalization in Node and Link Prediction
HMAR: Efficient Hierarchical Masked Auto-Regressive Image Generation
CAIFormer: A Causal Informed Transformer for Multivariate Time Series Forecasting
토론
이 논문과 연결된 포럼 글이 아직 없습니다.