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.