{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T18:01:01Z","timestamp":1781632861461,"version":"3.54.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:00:00Z","timestamp":1768780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:00:00Z","timestamp":1768780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Link Prediction (LP) aims to infer missing or future interactions in complex networks by exploiting structural patterns. Although widely applied in social, biological, and recommendation systems, traditional graph based LP methods rely solely on pairwise connections and therefore fail to capture the higher-order relationships that naturally arise in many real-world datasets. Hypergraphs offer a richer representation by allowing hyperedges to connect multiple nodes simultaneously. However, converting hypergraphs into simple graphs an approach commonly used in existing work collapses multi-node interactions and results in substantial information loss. Traditional LP metrics also treat all shared neighbors uniformly, despite the fact that shared neighbors may contribute differently to link formation depending on their structural importance or functional relevance. While centrality weighted LP extensions exist, they remain fundamentally restricted by graph structure and do not leverage higher-order dependencies. To address these limitations, we propose\n                    <jats:italic>CLPH<\/jats:italic>\n                    , a hypergraph based link prediction framework that incorporates hypercentrality to weight shared neighbors according to their structural influence. Experiments on four real-world hypergraphs demonstrate that CLPH achieves consistent improvements in AUPR, F1-score, and Precision. Notably, weighting shared neighbors using hypercentrality yields performance gains of 26%\u201368% compared to traditional centrality based weighting schemes.\n                  <\/jats:p>","DOI":"10.1007\/s42979-025-04697-5","type":"journal-article","created":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T09:36:00Z","timestamp":1768815360000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CLPH: Link Prediction in Complex Hyper Networks Through Centrality Weighted Shared Connections"],"prefix":"10.1007","volume":"7","author":[{"given":"Y. V.","family":"Nandini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T. Jaya","family":"Lakshmi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Murali Krishna","family":"Enduri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,19]]},"reference":[{"issue":"1","key":"4697_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si A-L. Statistical mechanics of complex networks. Rev Mod Phys. 2002;74(1):47.","journal-title":"Rev Mod Phys"},{"issue":"2","key":"4697_CR2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.107.024316","volume":"107","author":"A Vazquez","year":"2023","unstructured":"Vazquez A. Complex hypergraphs. Phys Rev E. 2023;107(2):024316.","journal-title":"Phys Rev E"},{"key":"4697_CR3","doi-asserted-by":"crossref","unstructured":"Liben-Nowell D, Kleinberg J. The link prediction problem for social networks. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management, 2003; pp. 556\u2013559.","DOI":"10.1145\/956863.956972"},{"issue":"3","key":"4697_CR4","first-page":"3245","volume":"45","author":"H Wu","year":"2022","unstructured":"Wu H, Yan Y, Ng MK-P. Hypergraph collaborative network on vertices and hyperedges. IEEE Trans Pattern Anal Mach Intell. 2022;45(3):3245\u201358.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"4697_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1186\/s12859-021-04197-2","volume":"22","author":"S Feng","year":"2021","unstructured":"Feng S, Heath E, Jefferson B, Joslyn C, Kvinge H, Mitchell HD, et al. Hypergraph models of biological networks to identify genes critical to pathogenic viral response. BMC Bioinform. 2021;22(1):287.","journal-title":"BMC Bioinform"},{"key":"4697_CR6","unstructured":"Chen C, Liu Y-Y. A survey on hyperlink prediction. IEEE Transactions on Neural Networks and Learning Systems 2023"},{"key":"4697_CR7","unstructured":"Saxena A, Iyengar S. Centrality measures in complex networks: a survey. 2020. arXiv preprint arXiv:2011.07190."},{"issue":"6","key":"4697_CR8","doi-asserted-by":"publisher","first-page":"433","DOI":"10.3390\/e26060433","volume":"26","author":"Y Nandini","year":"2024","unstructured":"Nandini Y, Lakshmi TJ, Enduri MK, Sharma H. Link prediction in complex networks using average centrality-based similarity score. Entropy. 2024;26(6):433.","journal-title":"Entropy"},{"key":"4697_CR9","doi-asserted-by":"publisher","first-page":"132502","DOI":"10.1109\/ACCESS.2020.3009733","volume":"8","author":"KS Sahoo","year":"2020","unstructured":"Sahoo KS, Tripathy BK, Naik K, Ramasubbareddy S, Balusamy B, Khari M, et al. An evolutionary svm model for ddos attack detection in software defined networks. IEEE Access. 2020;8:132502\u201313.","journal-title":"IEEE Access"},{"key":"4697_CR10","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.comcom.2020.03.004","volume":"154","author":"S Vimal","year":"2020","unstructured":"Vimal S, Khari M, Crespo RG, Kalaivani L, Dey N, Kaliappan M. Energy enhancement using multiobjective ant colony optimization with double q learning algorithm for iot based cognitive radio networks. Comput Commun. 2020;154:481\u201390.","journal-title":"Comput Commun"},{"key":"4697_CR11","doi-asserted-by":"publisher","first-page":"118396","DOI":"10.1109\/ACCESS.2020.3004233","volume":"8","author":"A Rajagopal","year":"2020","unstructured":"Rajagopal A, Ramachandran A, Shankar K, Khari M, Jha S, Lee Y, et al. Fine-tuned residual network-based features with latent variable support vector machine-based optimal scene classification model for unmanned aerial vehicles. IEEE Access. 2020;8:118396\u2013404.","journal-title":"IEEE Access"},{"issue":"3","key":"4697_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/sat.1391","volume":"39","author":"A Rajagopal","year":"2021","unstructured":"Rajagopal A, Ramachandran A, Shankar K, Khari M, Jha S, Joshi GP. Optimal routing strategy based on extreme learning machine with beetle antennae search algorithm for low earth orbit satellite communication networks. Int J Satell Commun Netw. 2021;39(3):305\u201317.","journal-title":"Int J Satell Commun Netw"},{"key":"4697_CR13","doi-asserted-by":"crossref","unstructured":"Addula SR, Kumar MK, Kumar D, Ananthan B. et\u00a0al. Dynamic load balancing in cloud computing using hybrid kookaburra-pelican optimization algorithms. In: 2024 International Conference on Augmented Reality, Intelligent Systems, and Industrial Automation (ARIIA), 2024; pp. 1\u20137. IEEE","DOI":"10.1109\/ARIIA63345.2024.11051893"},{"key":"4697_CR14","unstructured":"Estrada E, Rodriguez-Velazquez JA. Complex networks as hypergraphs. 2005. arXiv preprint physics\/0505137."},{"key":"4697_CR15","doi-asserted-by":"crossref","unstructured":"Kumar T, Darwin K, Parthasarathy S, Ravindran B. Hpra: Hyperedge prediction using resource allocation. In: Proceedings of the 12th ACM Conference on Web Science, 2020; pp. 135\u2013143.","DOI":"10.1145\/3394231.3397903"},{"key":"4697_CR16","doi-asserted-by":"crossref","unstructured":"Nandini Y, Lakshmi TJ, Enduri MK, Sharma H, Ahmad MW. Extending graph-based lp techniques for enhanced insights into complex hypergraph networks. IEEE Access. 2024.","DOI":"10.1109\/ACCESS.2024.3385320"},{"key":"4697_CR17","first-page":"238","volume":"1","author":"LC Freeman","year":"2002","unstructured":"Freeman LC, et al. Centrality in social networks: Conceptual clarification. Social network: critical concepts in sociology. Londres: Routledge. 2002;1:238\u201363.","journal-title":"Londres: Routledge"},{"issue":"5","key":"4697_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.056114","volume":"74","author":"M\u00c1 Serrano","year":"2006","unstructured":"Serrano M\u00c1, Boguna M. Clustering in complex networks. i. General formalism. Phys Rev E-Stat Nonlinear Soft Matter Phys. 2006;74(5):056114.","journal-title":"Phys Rev E-Stat Nonlinear Soft Matter Phys"},{"issue":"2","key":"4697_CR19","doi-asserted-by":"publisher","first-page":"88669","DOI":"10.1371\/journal.pone.0088669","volume":"9","author":"G Costantini","year":"2014","unstructured":"Costantini G, Perugini M. Generalization of clustering coefficients to signed correlation networks. PLoS ONE. 2014;9(2):88669.","journal-title":"PLoS ONE"},{"key":"4697_CR20","doi-asserted-by":"crossref","unstructured":"Freeman L. A set of measures of centrality based on betweenness. Sociometry. 1977.","DOI":"10.2307\/3033543"},{"key":"4697_CR21","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"M Newman","year":"2018","unstructured":"Newman M. Networks. Oxford University Press; 2018."},{"key":"4697_CR22","doi-asserted-by":"crossref","unstructured":"Roy S, Ravindran B. Measuring network centrality using hypergraphs. In: Proceedings of the 2nd ACM IKDD Conference on Data Sciences, 2015; pp. 59\u201368.","DOI":"10.1145\/2732587.2732595"},{"key":"4697_CR23","doi-asserted-by":"crossref","unstructured":"Li D, Xu Z, Li S, Sun X.: Link prediction in social networks based on hypergraph. In: Proceedings of the 22nd International Conference on World Wide Web, 2013; pp. 41\u201342.","DOI":"10.1145\/2487788.2487802"},{"issue":"3","key":"4697_CR24","first-page":"407","volume":"14","author":"\u0130 Tu\u011fal","year":"2023","unstructured":"Tu\u011fal \u0130, Pala Z. Centrality with entropy in hypergraphs based on similarity measures. Dicle \u00dcniversitesi M\u00fchendislik Fak\u00fcltesi M\u00fchendislik Dergisi. 2023;14(3):407\u201319.","journal-title":"Dicle \u00dcniversitesi M\u00fchendislik Fak\u00fcltesi M\u00fchendislik Dergisi"},{"issue":"1","key":"4697_CR25","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1140\/epjds\/s13688-020-00231-0","volume":"9","author":"SG Aksoy","year":"2020","unstructured":"Aksoy SG, Joslyn C, Marrero CO, Praggastis B, Purvine E. Hypernetwork science via high-order hypergraph walks. EPJ Data Sci. 2020;9(1):16.","journal-title":"EPJ Data Sci"},{"key":"4697_CR26","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115","author":"AR Benson","year":"2018","unstructured":"Benson AR, Abebe R, Schaub MT, Jadbabaie A, Kleinberg J. Simplicial closure and higher-order link prediction. Proc Natl Acad Sci. 2018. https:\/\/doi.org\/10.1073\/pnas.1800683115.","journal-title":"Proc Natl Acad Sci."},{"issue":"9","key":"4697_CR27","doi-asserted-by":"publisher","first-page":"0136497","DOI":"10.1371\/journal.pone.0136497","volume":"10","author":"R Mastrandrea","year":"2015","unstructured":"Mastrandrea R, Fournet J, Barrat A. Contact patterns in a high school: A comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS ONE. 2015;10(9):0136497. https:\/\/doi.org\/10.1371\/journal.pone.0136497.","journal-title":"PLoS ONE"},{"key":"4697_CR28","unstructured":"Boyd K, Eng KH, Page CD. Area under the precision-recall curve: point estimates and confidence intervals. In: Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23-27, 2013, Proceedings, Part III 13, 2013; pp. 451\u2013466. Springer"},{"key":"4697_CR29","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s10115-014-0789-0","volume":"45","author":"Y Yang","year":"2015","unstructured":"Yang Y, Lichtenwalter RN, Chawla NV. Evaluating link prediction methods. Knowl Inf Syst. 2015;45:751\u201382.","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"4697_CR30","doi-asserted-by":"publisher","DOI":"10.1088\/2632-072X\/ad46be","volume":"5","author":"X Jiao","year":"2024","unstructured":"Jiao X, Wan S, Liu Q, Bi Y, Lee Y-L, Xu E, et al. Comparing discriminating abilities of evaluation metrics in link prediction. J Phys Complex. 2024;5(2):025014.","journal-title":"J Phys Complex"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04697-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-025-04697-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04697-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T17:49:18Z","timestamp":1781632158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-025-04697-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,19]]},"references-count":30,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["4697"],"URL":"https:\/\/doi.org\/10.1007\/s42979-025-04697-5","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,19]]},"assertion":[{"value":"20 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors do not have any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research Involving Human and \/or Animals"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}},{"value":"For the purpose of open access, the author has applied a Creative Commons Attribution (CC BY) license to any Author Accepted Manuscript version of this paper arising from this submission.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Rights Retention Statement"}}],"article-number":"119"}}