Graphlet- and motif-based link prediction in large networks.

IF 10.8 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Patterns Pub Date : 2026-06-11 eCollection Date: 2026-07-10 DOI:10.1016/j.patter.2026.101586
Wayne B Hayes, Kimia Yazdani, S M A Nahian, Ezra Alemu
{"title":"Graphlet- and motif-based link prediction in large networks.","authors":"Wayne B Hayes, Kimia Yazdani, S M A Nahian, Ezra Alemu","doi":"10.1016/j.patter.2026.101586","DOIUrl":null,"url":null,"abstract":"<p><p>Link prediction is important across biological, social, and technological networks, but many methods either require domain-specific node attributes, do not scale to large graphs, or miss higher-order topology. We present BLANT-Predict, a topology-only framework that uses sampled graphlets and orbit-pair frequencies to rank likely missing edges. Across 12 real-world networks (up to about 1 million nodes and 3 million edges), we compare against 13 baseline methods and observe higher precision with strong scalability. Beyond standard <i>k</i>-fold cross-validation, we evaluate predictions against future out-of-sample network snapshots to better reflect real deployment. BLANT-Predict maintains superior precision in these future tests, indicating practical value for predicting previously unobserved links.</p>","PeriodicalId":36242,"journal":{"name":"Patterns","volume":"7 7","pages":"101586"},"PeriodicalIF":10.8000,"publicationDate":"2026-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13366520/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Patterns","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/j.patter.2026.101586","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/7/10 0:00:00","PubModel":"eCollection","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Link prediction is important across biological, social, and technological networks, but many methods either require domain-specific node attributes, do not scale to large graphs, or miss higher-order topology. We present BLANT-Predict, a topology-only framework that uses sampled graphlets and orbit-pair frequencies to rank likely missing edges. Across 12 real-world networks (up to about 1 million nodes and 3 million edges), we compare against 13 baseline methods and observe higher precision with strong scalability. Beyond standard k-fold cross-validation, we evaluate predictions against future out-of-sample network snapshots to better reflect real deployment. BLANT-Predict maintains superior precision in these future tests, indicating practical value for predicting previously unobserved links.

基于Graphlet和motif的大型网络链路预测。
链接预测在生物、社会和技术网络中都很重要,但是许多方法要么需要特定于领域的节点属性,要么不能扩展到大的图,要么缺少高阶拓扑。我们提出了BLANT-Predict,这是一个仅限拓扑的框架,它使用采样的石墨烯和轨道对频率来对可能缺失的边进行排序。在12个真实世界的网络(多达100万个节点和300万个边)中,我们与13种基线方法进行了比较,并观察到具有强大可扩展性的更高精度。除了标准的k-fold交叉验证之外,我们根据未来的样本外网络快照评估预测,以更好地反映实际部署。BLANT-Predict在这些未来的测试中保持了较高的精度,表明了预测以前未观察到的链接的实用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Patterns
Patterns Decision Sciences-Decision Sciences (all)
CiteScore
10.60
自引率
4.60%
发文量
153
审稿时长
19 weeks
期刊介绍:
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书