{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T02:53:07Z","timestamp":1780109587827,"version":"3.54.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T00:00:00Z","timestamp":1737676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T00:00:00Z","timestamp":1737676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key RD Program of China","award":["2023YFC2705700"],"award-info":[{"award-number":["2023YFC2705700"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation, China","doi-asserted-by":"crossref","award":["2022M712461"],"award-info":[{"award-number":["2022M712461"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62225113"],"award-info":[{"award-number":["62225113"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62206202"],"award-info":[{"award-number":["62206202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Link prediction is essential for identifying hidden relationships within network data, with significant implications for fields such as social network analysis and bioinformatics. Traditional methods often overlook potential relationships among common neighbors, limiting their effectiveness in utilizing graph information fully. To address this, we introduce a novel approach, Common Neighbor Completion with Information Entropy (IECNC), which enhances model expressiveness by considering logical neighbor relationships. Our method integrates a dynamic node function with a Message Passing Neural Network (MPNN), focusing on first-order neighbors and employing set-based aggregation to improve missing link predictions. By combining the information entropy of probabilistic predictions of common neighbors with MPNN and leveraging information entropy to assess uncertainty in adjacent connections, our approach significantly enhances prediction accuracy. Experimental results demonstrate that our IECNC method achieves optimal performance across multiple datasets, surpassing existing techniques. Furthermore, visualizations confirm that our model effectively captures and accurately learns feature information from various categories, Demonstrating the method\u2019s efficacy and adaptability.<\/jats:p>","DOI":"10.1007\/s41019-024-00267-6","type":"journal-article","created":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T07:53:23Z","timestamp":1737705203000},"page":"40-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Common Neighbor Completion with Information Entropy for Link Prediction in Social Networks"],"prefix":"10.1007","volume":"10","author":[{"given":"Zhengyun","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guojia","family":"Wan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Du","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,24]]},"reference":[{"key":"267_CR1","unstructured":"Trouillon T, Welbl J, Riedel S, Gaussier E, Bouchard G (2016) Complex embeddings for simple link prediction. In: International conference on machine learning. PMLR, pp 2071\u20132080"},{"issue":"4","key":"267_CR2","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1109\/TCSS.2022.3180586","volume":"10","author":"F Mubang","year":"2022","unstructured":"Mubang F, Hall LO (2022) Vam: an end-to-end simulator for time series regression and temporal link prediction in social media networks. IEEE Trans Comput Soc Syst 10(4):1479\u20131490","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"3","key":"267_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.3390\/info13030123","volume":"13","author":"V Carchiolo","year":"2022","unstructured":"Carchiolo V, Cavallo C, Grassia M, Malgeri M, Mangioni G (2022) Link prediction in time varying social networks. Information 13(3):123","journal-title":"Information"},{"issue":"1","key":"267_CR4","doi-asserted-by":"publisher","first-page":"40321","DOI":"10.1038\/srep40321","volume":"7","author":"Z Stanfield","year":"2017","unstructured":"Stanfield Z, Co\u015fkun M, Koyut\u00fcrk M (2017) Drug response prediction as a link prediction problem. Sci Rep 7(1):40321","journal-title":"Sci Rep"},{"key":"267_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2021.104772","volume":"137","author":"E Nasiri","year":"2021","unstructured":"Nasiri E, Berahmand K, Rostami M, Dabiri M (2021) A novel link prediction algorithm for protein-protein interaction networks by attributed graph embedding. Comput Biol Med 137:104772","journal-title":"Comput Biol Med"},{"key":"267_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-021-00422-0","volume":"8","author":"M Vahidi Farashah","year":"2021","unstructured":"Vahidi Farashah M, Etebarian A, Azmi R, Ebrahimzadeh Dastjerdi R (2021) A hybrid recommender system based-on link prediction for movie baskets analysis. J Big Data 8:1\u201324","journal-title":"J Big Data"},{"key":"267_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106553","volume":"124","author":"Y Afoudi","year":"2023","unstructured":"Afoudi Y, Lazaar M, Hmaidi S (2023) An enhanced recommender system based on heterogeneous graph link prediction. Eng Appl Artif Intell 124:106553","journal-title":"Eng Appl Artif Intell"},{"key":"267_CR8","doi-asserted-by":"crossref","unstructured":"Xiao P, Du B, Yun S, Lit X, Zhang Y, Wu J (2018) Probabilistic graph embedding for unsupervised domain adaptation. In: 2018 24th international conference on pattern recognition (ICPR), pp 1283\u20131288","DOI":"10.1109\/ICPR.2018.8546005"},{"key":"267_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2021.101358","volume":"53","author":"G Wang","year":"2021","unstructured":"Wang G, Wang Y, Li J, Liu K (2021) A multidimensional network link prediction algorithm and its application for predicting social relationships. J Comput Sci 53:101358","journal-title":"J Comput Sci"},{"key":"267_CR10","unstructured":"Zhang M, Chen Y (2020) Inductive matrix completion based on graph neural networks. In: International conference on learning representations"},{"key":"267_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.125154","volume":"560","author":"Z Su","year":"2020","unstructured":"Su Z, Zheng X, Ai J, Shen Y, Zhang X (2020) Link prediction in recommender systems based on vector similarity. Phys A 560:125154","journal-title":"Phys A"},{"key":"267_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102716","volume":"166","author":"NN Daud","year":"2020","unstructured":"Daud NN, Ab Hamid SH, Saadoon M, Sahran F, Anuar NB (2020) Applications of link prediction in social networks: a review. J Netw Comput Appl 166:102716","journal-title":"J Netw Comput Appl"},{"key":"267_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.121319","volume":"528","author":"R Pech","year":"2019","unstructured":"Pech R, Hao D, Lee Y-L, Yuan Y, Zhou T (2019) Link prediction via linear optimization. Phys A 528:121319","journal-title":"Phys A"},{"key":"267_CR14","first-page":"32928","volume":"35","author":"F Poursafaei","year":"2022","unstructured":"Poursafaei F, Huang S, Pelrine K, Rabbany R (2022) Towards better evaluation for dynamic link prediction. Adv Neural Inf Process Syst 35:32928\u201332941","journal-title":"Adv Neural Inf Process Syst"},{"key":"267_CR15","first-page":"4289","volume":"31","author":"SM Kazemi","year":"2018","unstructured":"Kazemi SM, Poole D (2018) Simple embedding for link prediction in knowledge graphs. Adv Neural Inf Process Syst 31:4289\u20134300","journal-title":"Adv Neural Inf Process Syst"},{"key":"267_CR16","doi-asserted-by":"crossref","unstructured":"Xiao P, Du B, Wu J, Zhang L, Hu R, Li X (2018) Tlr: transfer latent representation for unsupervised domain adaptation. In: 2018 IEEE international conference on multimedia and Expo (ICME), pp 1\u20136","DOI":"10.1109\/ICME.2018.8486513"},{"key":"267_CR17","doi-asserted-by":"crossref","unstructured":"Xiao P, Qiu P, Ha SM, Bani A, Zhou S, Sotiras A (2023) Sc-vae: sparse coding-based variational autoencoder with learned ista. Available at SSRN 4794775","DOI":"10.2139\/ssrn.4794775"},{"issue":"1","key":"267_CR18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TCSS.2022.3155946","volume":"10","author":"M Toprak","year":"2022","unstructured":"Toprak M, Boldrini C, Passarella A, Conti M (2022) Harnessing the power of ego network layers for link prediction in online social networks. IEEE Trans Comput Soc Syst 10(1):48\u201360","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"267_CR19","unstructured":"Gilmer J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE (2017) Neural message passing for quantum chemistry. In: International conference on machine learning, pp 1263\u20131272"},{"key":"267_CR20","unstructured":"Kipf TN, Welling M (2016) Variational graph auto-encoders. arXiv preprint arXiv:1611.07308"},{"key":"267_CR21","first-page":"5171","volume":"31","author":"M Zhang","year":"2018","unstructured":"Zhang M, Chen Y (2018) Link prediction based on graph neural networks. Adv Neural Inf Process Syst 31:5171\u20135181","journal-title":"Adv Neural Inf Process Syst"},{"key":"267_CR22","first-page":"13683","volume":"34","author":"S Yun","year":"2021","unstructured":"Yun S, Kim S, Lee J, Kang J, Kim HJ (2021) Neo-gnns: neighborhood overlap-aware graph neural networks for link prediction. Adv Neural Inf Process Syst 34:13683\u201313694","journal-title":"Adv Neural Inf Process Syst"},{"key":"267_CR23","unstructured":"Chamberlain B, Shirobokov S, Ross E, Frasca F, Markovich T, Hammerla N, Bronstein M, Hansmire M (2022) Graph neural networks for link prediction with subgraph sketching. In: International conference on learning representations, p 2209"},{"key":"267_CR24","unstructured":"X.\u00a0Wang HY, Zhang M (2024) Neural common neighbor with completion for link prediction. In: International conference on learning representations"},{"key":"267_CR25","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: ACM SIGKDD International conference on knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"267_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.124289","volume":"553","author":"A Kumar","year":"2020","unstructured":"Kumar A, Singh SS, Singh K, Biswas B (2020) Link prediction techniques, applications, and performance: a survey. Phys A 553:124289","journal-title":"Phys A"},{"key":"267_CR27","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.procs.2016.04.102","volume":"83","author":"L Yao","year":"2016","unstructured":"Yao L, Wang L, Pan L, Yao K (2016) Link prediction based on common-neighbors for dynamic social network. Proc Comput Sci 83:82\u201389","journal-title":"Proc Comput Sci"},{"issue":"5439","key":"267_CR28","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"2","key":"267_CR29","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"MEJ Newman","year":"2001","unstructured":"Newman MEJ (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci 98(2):404\u2013409","journal-title":"Proc Natl Acad Sci"},{"issue":"7","key":"267_CR30","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inform Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inform Sci Technol"},{"issue":"5439","key":"267_CR31","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1isi","year":"1999","unstructured":"Barab\u00e1isi AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"4","key":"267_CR32","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"LT Zhou","year":"2009","unstructured":"Zhou LT, Lv Zhang Y-C (2009) Predicting missing links via local information. Eur Phys J B 71(4):623\u2013630","journal-title":"Eur Phys J B"},{"issue":"3","key":"267_CR33","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230","journal-title":"Soc Netw"},{"key":"267_CR34","doi-asserted-by":"crossref","unstructured":"Jiang B, Zhang Z, Lin D, Tang J, Luo B (2019) Semi-supervised learning with graph learning-convolutional networks. In: Computer vision and pattern recognition, pp. 11305\u201311312","DOI":"10.1109\/CVPR.2019.01157"},{"issue":"1","key":"267_CR35","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2021","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Yu PS (2021) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"6","key":"267_CR36","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc L, Zhou T (2011) Link prediction in complex networks: a survey. Phys A 390(6):1150\u20131170","journal-title":"Phys A"},{"key":"267_CR37","unstructured":"Hamilton WL, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Neural information processing systems"},{"key":"267_CR38","unstructured":"Zhu Z, Zhang Z, Xhonneux L-P, Tang J (2021) Neural bellman-ford networks: a general graph neural network framework for link prediction. In: Neural information processing systems"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00267-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-024-00267-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00267-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T04:17:37Z","timestamp":1740802657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-024-00267-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,24]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["267"],"URL":"https:\/\/doi.org\/10.1007\/s41019-024-00267-6","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,24]]},"assertion":[{"value":"15 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}