Inductive Link Prediction for Nodes Having Only Attribute Information
원문 초록
Predicting the link between two nodes is a fundamental problem for graph data analytics. In attributed graphs, both the structure and attribute information can be utilized for link prediction. Most existing studies focus on transductive link prediction where both nodes are already in the graph. However, many real-world applications require inductive prediction for new nodes having only attribute information. It is more challenging since the new nodes do not have structure information and cannot be seen during the model training. To solve this problem, we propose a model called DEAL, which consists of three components: two node embedding encoders and one alignment mechanism. The two encoders aim to output the attribute-oriented node embedding and the structure-oriented node embedding, and the alignment mechanism aligns the two types of embeddings to build the connections between the attributes and links. Our model DEAL is versatile in the sense that it works for both inductive and transductive link prediction. Extensive experiments on several benchmark datasets show that our proposed model significantly outperforms existing inductive link prediction methods, and also outperforms the state-of-the-art methods on transductive link prediction.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Cross view link prediction by learning noise-resilient representation consensus
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
Learnable Spatial-Temporal Positional Encoding for Link Prediction
Understanding Generalization in Node and Link Prediction
Open-World Social Event Classification
EasySpider: A No-Code Visual System for Crawling the Web
토론
이 논문과 연결된 포럼 글이 아직 없습니다.