{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T17:13:25Z","timestamp":1774890805784,"version":"3.50.1"},"reference-count":27,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Yunnan Province Major Science and Technology Special Plan","award":["202102AA100021"],"award-info":[{"award-number":["202102AA100021"]}]},{"name":"Yunnan Province Major Science and Technology Special Plan","award":["62066048"],"award-info":[{"award-number":["62066048"]}]},{"name":"Yunnan Province Major Science and Technology Special Plan","award":["89-Y50G31-9001-22\/23"],"award-info":[{"award-number":["89-Y50G31-9001-22\/23"]}]},{"name":"Yunnan Province Major Science and Technology Special Plan","award":["202101AT070167"],"award-info":[{"award-number":["202101AT070167"]}]},{"name":"National Natural Science Foundation of China","award":["202102AA100021"],"award-info":[{"award-number":["202102AA100021"]}]},{"name":"National Natural Science Foundation of China","award":["62066048"],"award-info":[{"award-number":["62066048"]}]},{"name":"National Natural Science Foundation of China","award":["89-Y50G31-9001-22\/23"],"award-info":[{"award-number":["89-Y50G31-9001-22\/23"]}]},{"name":"National Natural Science Foundation of China","award":["202101AT070167"],"award-info":[{"award-number":["202101AT070167"]}]},{"name":"Major Project of a High-Resolution Earth Observation System from the National Defense Science and Technology Industry Bureau","award":["202102AA100021"],"award-info":[{"award-number":["202102AA100021"]}]},{"name":"Major Project of a High-Resolution Earth Observation System from the National Defense Science and Technology Industry Bureau","award":["62066048"],"award-info":[{"award-number":["62066048"]}]},{"name":"Major Project of a High-Resolution Earth Observation System from the National Defense Science and Technology Industry Bureau","award":["89-Y50G31-9001-22\/23"],"award-info":[{"award-number":["89-Y50G31-9001-22\/23"]}]},{"name":"Major Project of a High-Resolution Earth Observation System from the National Defense Science and Technology Industry Bureau","award":["202101AT070167"],"award-info":[{"award-number":["202101AT070167"]}]},{"name":"Yunnan Provincial Natural Science Foundation","award":["202102AA100021"],"award-info":[{"award-number":["202102AA100021"]}]},{"name":"Yunnan Provincial Natural Science Foundation","award":["62066048"],"award-info":[{"award-number":["62066048"]}]},{"name":"Yunnan Provincial Natural Science Foundation","award":["89-Y50G31-9001-22\/23"],"award-info":[{"award-number":["89-Y50G31-9001-22\/23"]}]},{"name":"Yunnan Provincial Natural Science Foundation","award":["202101AT070167"],"award-info":[{"award-number":["202101AT070167"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Link prediction aims to identify unknown or missing connections in a network. The methods based on network structure similarity, known for their simplicity and effectiveness, have garnered widespread attention. A core metric in these methods is \u201cproximity\u201d, which measures the similarity or linking probability between two nodes. These methods generally operate under the assumption that node pairs with higher proximity are more likely to form new connections. However, the accuracy of existing node proximity-based link prediction algorithms requires improvement. To address this, this paper introduces a Link Prediction Algorithm Based on Weighted Local and Global Closeness (LGC). This algorithm integrates the clustering coefficient to enhance prediction accuracy. A significant advantage of LGC is its dual consideration of a network\u2019s local and global features, allowing for a more precise assessment of node similarity. In experiments conducted on ten real-world datasets, the proposed LGC algorithm outperformed eight traditional link prediction methods, showing notable improvements in key evaluation metrics, namely precision and AUC.<\/jats:p>","DOI":"10.3390\/e25111517","type":"journal-article","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T01:37:09Z","timestamp":1699234629000},"page":"1517","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Link Prediction Algorithm Based on Weighted Local and Global Closeness"],"prefix":"10.3390","volume":"25","author":[{"given":"Jian","family":"Wang","sequence":"first","affiliation":[{"name":"Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China"},{"name":"Yunnan Key Laboratory of Artificial Intelligence, Kunming University of Science and Technology, Kunming 650500, China"}]},{"given":"Jun","family":"Ning","sequence":"additional","affiliation":[{"name":"Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China"},{"name":"Yunnan Key Laboratory of Artificial Intelligence, Kunming University of Science and Technology, Kunming 650500, China"}]},{"given":"Lingcong","family":"Nie","sequence":"additional","affiliation":[{"name":"Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China"},{"name":"Yunnan Key Laboratory of Artificial Intelligence, Kunming University of Science and Technology, Kunming 650500, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3252-2845","authenticated-orcid":false,"given":"Qian","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Software, Yunnan University, Kunming 650091, China"},{"name":"School of Management, Harbin Institute of Technology, Harbin 150001, China"}]},{"given":"Na","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Software, Yunnan University, Kunming 650091, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,11,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1038\/s41586-018-0720-z","article-title":"Cryptic connections illuminate pathogen transmission within community networks","volume":"563","author":"Hoyt","year":"2018","journal-title":"Nature"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1177\/01655515211047428","article-title":"A social network analysis\u2013based approach to investigate user behavior during a cryptocurrency speculative bubble","volume":"49","author":"Bonifazi","year":"2021","journal-title":"J. Inf. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.ins.2015.05.014","article-title":"Discovering missing me edges across social networks","volume":"319","author":"Buccafurri","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1093\/bioinformatics\/bty637","article-title":"Random walk with restart on multiplex and heterogeneous biological networks","volume":"35","author":"Valdeolivas","year":"2019","journal-title":"Bioinformatics"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.joi.2010.10.008","article-title":"Scientific collaboration and endorsement: Network analysis of coauthorship and citation networks","volume":"5","author":"Ding","year":"2011","journal-title":"J. Informetr."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"102048","DOI":"10.1016\/j.datak.2022.102048","article-title":"An approach to detect backbones of information diffusers among different communities of a social platform","volume":"140","author":"Bonifazi","year":"2022","journal-title":"Data Knowl. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Buccafurri, F., and Lax, G. (2010, January 7\u20139). Improving similarity-based methods for information propagation on social networks. Proceedings of the International Conference on Networked Digital Technologies, Prague, Czech Republic.","DOI":"10.1007\/978-3-642-14292-5_40"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Rosvall, M., and Bergstrom, C.T. (2010). Mapping change in large networks. PLoS ONE, 5.","DOI":"10.1371\/journal.pone.0008694"},{"key":"ref_9","first-page":"1","article-title":"A survey of link prediction in complex networks","volume":"49","author":"Berzal","year":"2016","journal-title":"ACM Comput. Surv."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Li, R.H., Yu, J.X., and Liu, J. (2011, January 24\u201328). Link prediction: The power of maximal entropy random walk. Proceedings of the 20th ACM International Conference on Information and Knowledge Management, Glasgow, UK.","DOI":"10.1145\/2063576.2063741"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"345001","DOI":"10.1088\/1751-8113\/45\/34\/345001","article-title":"Performance of local information-based link prediction: A sampling perspective","volume":"45","author":"Zhao","year":"2012","journal-title":"J. Phys. A Math. Theor."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"17014","DOI":"10.1038\/s41598-018-35423-2","article-title":"Similarity-based future common neighbors model for link prediction in complex networks","volume":"8","author":"Li","year":"2018","journal-title":"Sci. Rep."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"025102","DOI":"10.1103\/PhysRevE.64.025102","article-title":"Clustering and preferential attachment in growing networks","volume":"64","author":"Newman","year":"2001","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","article-title":"Friends and neighbors on the web","volume":"25","author":"Adamic","year":"2003","journal-title":"Soc. Netw."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","article-title":"Predicting missing links via local information","volume":"71","author":"Zhou","year":"2009","journal-title":"Eur. Phys. J. B"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","article-title":"Link prediction in complex networks: A survey","volume":"390","author":"Lu","year":"2011","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"021102","DOI":"10.1103\/PhysRevE.75.021102","article-title":"Power-law strength-degree correlation from resource-allocation dynamics on weighted networks","volume":"75","author":"Ou","year":"2007","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physa.2016.01.038","article-title":"Link prediction with node clustering coefficient","volume":"452","author":"Wu","year":"2016","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz","year":"1953","journal-title":"Psychometrika"},{"key":"ref_20","first-page":"98","article-title":"Link prediction algorithm based on clustering coefficient and node centrality","volume":"62","author":"Yu","year":"2022","journal-title":"J. Tsinghua Univ."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"046122","DOI":"10.1103\/PhysRevE.80.046122","article-title":"Similarity index based on local paths for link prediction of complex networks","volume":"80","author":"Jin","year":"2009","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"124289","DOI":"10.1016\/j.physa.2020.124289","article-title":"Link prediction techniques, applications, and performance: A survey","volume":"553","author":"Kumar","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Lichtenwalter, R.N., Lussier, J.T., and Chawla, N.V. (2010, January 24\u201328). New perspectives and methods in link prediction. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA.","DOI":"10.1145\/1835804.1835837"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C. (2011). Social Network Data Analytics, Springer.","DOI":"10.1007\/978-1-4419-8462-3"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-P\u00e9rez, G., Aliakbarisani, R., Ghasemi, A., and Serrano, M. (2019). Predictability of missing links in complex networks. arXiv.","DOI":"10.1103\/PhysRevE.101.052318"},{"key":"ref_26","unstructured":"Al Hasan, M., Chaoji, V., Salem, S., and Zaki, M. (2006, January 19). Link prediction using supervised learning. Proceedings of the SDM06: Workshop on Link Analysis, Counter-Terrorism and Security, Bethesda, MD, USA."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.physa.2015.01.083","article-title":"Accuracy test for link prediction in terms of similarity index: The case of WS and BA models","volume":"429","author":"Ahn","year":"2015","journal-title":"Phys. A Stat. Mech. Its Appl."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/11\/1517\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:18:00Z","timestamp":1760131080000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/11\/1517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":27,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2023,11]]}},"alternative-id":["e25111517"],"URL":"https:\/\/doi.org\/10.3390\/e25111517","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,6]]}}}