Process / pipeline
链接预测 — 网络中缺失和未来连接的推断
链接预测是一项网络分析任务，用于估计观察到的图中缺失的边或未来可能形成的边。该任务由 Liben-Nowell 和 Kleinberg (2003, 2007) 正式提出，涵盖了一系列方法——从简单的结构相似性指标，如共同邻居数、Jaccard 系数和 Adamic-Adar 指数，到矩阵分解和图神经网络 (GNN) 方法——并使用 AUC 和平均精度 (Average Precision) 进行评估，以处理真实边与不存在边之间严重不平衡的比例。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Liben-Nowell, D. & Kleinberg, J. (2007). The Link-Prediction Problem for Social Networks. Journal of the American Society for Information Science and Technology, 58(7), 1019-1031. DOI: 10.1002/asi.20591 ↗
- Zhang, M. & Chen, Y. (2018). Link Prediction Based on Graph Neural Networks. Advances in Neural Information Processing Systems (NeurIPS), 31. link ↗
如何引用本页
ScholarGate. (2026, June 1). Link Prediction (Missing and Future Edge Inference). ScholarGate. https://scholargate.app/zh/network-analysis/link-prediction
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →