Edge2Node: Reducing Edge Prediction to Node Classification
Despite the success of graph neural network models in node classification, edge prediction (the task of predicting missing or potential links between nodes in a graph) remains a challenging problem for these models. A common approach for edge prediction is to first obtain the embeddings of two nodes, and then a predefined scoring function is used to predict the existence of an edge between the two nodes. Here, we introduce a preliminary idea called Edge2Node which suggests to directly obtain an embedding for each edge, without the need for a scoring function. This idea wants to create a new graph H based on the graph G given for the edge prediction task, and then suggests reducing the edge prediction task on G to a node classification task on H. We anticipate that this introductory method could stimulate further investigations for edge prediction task.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph Neural NetworkLink PredictionLink Property PredictionNode ClassificationPredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Refined Edge Usage of Graph Neural Networks for Edge Prediction
Graph Neural Networks (GNNs), originally proposed for node classification, have also motivated many recent works on edge prediction (a.k.a., link prediction). However, existing methods lack elaborate design regarding the…
Link PredictionNode ClassificationPredictionA Hypergraph Neural Network Framework for Learning Hyperedge-Dependent Node Embeddings
In this work, we introduce a hypergraph representation learning framework called Hypergraph Neural Networks (HNN) that jointly learns hyperedge embeddings along with a set of hyperedge-dependent embeddings for each node …
Hyperedge PredictionNode ClassificationRepresentation LearningHeterophily-Aware Adaptive Knowledge Distillation for Hypergraph Neural Networks
Hypergraph knowledge distillation aims to retain the predictive performance of a hypergraph neural network (HNN) teacher while reducing inference costs through a lightweight student model. In this work, we observe that H…
Knowledge DistillationHet-node2vec: second order random walk sampling for heterogeneous multigraphs embedding
Many real-world problems are naturally modeled as heterogeneous graphs, where nodes and edges represent multiple types of entities and relations. Existing learning models for heterogeneous graph representation usually de…
Graph Representation LearningRepresentation LearningPipeNet: Question Answering with Semantic Pruning over Knowledge Graphs
It is well acknowledged that incorporating explicit knowledge graphs (KGs) can benefit question answering. Existing approaches typically follow a grounding-reasoning pipeline in which entity nodes are first grounded for …
Graph AttentionKnowledge GraphsQuestion Answering