Evaluating Link Prediction Accuracy on Dynamic Networks with Added and Removed Edges
원문 초록
The task of predicting future relationships in a social network, known as link prediction, has been studied extensively in the literature. Many link prediction methods have been proposed, ranging from common neighbors to probabilistic models. Recent work by Yang et al. has highlighted several challenges in evaluating link prediction accuracy. In dynamic networks where edges are both added and removed over time, the link prediction problem is more complex and involves predicting both newly added and newly removed edges. This results in new challenges in the evaluation of dynamic link prediction methods, and the recommendations provided by Yang et al. are no longer applicable, because they do not address edge removal. In this paper, we investigate several metrics currently used for evaluating accuracies of dynamic link prediction methods and demonstrate why they can be misleading in many cases. We provide several recommendations on evaluating dynamic link prediction accuracy, including separation into two categories of evaluation. Finally we propose a unified metric to characterize link prediction accuracy effectively using a single number.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A PID-Controlled Tensor Wheel Decomposition Model for Dynamic Link Prediction
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
VitaGraph: Building a Knowledge Graph for Biologically Relevant Learning Tasks
MUST: Multi-Scale Structural-Temporal Link Prediction Model for UAV Ad Hoc Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.