{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:03:50Z","timestamp":1776441830862,"version":"3.51.2"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ins.2026.123522","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T20:23:29Z","timestamp":1776284609000},"page":"123522","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A virtual node based zero-shot learning framework for link prediction in complex networks"],"prefix":"10.1016","volume":"748","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6352-1979","authenticated-orcid":false,"given":"Haotian","family":"Xie","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3688-9281","authenticated-orcid":false,"given":"Yang","family":"Pu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8105-090X","authenticated-orcid":false,"given":"Yongqi","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Yan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ins.2026.123522_bib0005","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1038\/nphys2188","article-title":"The network takeover","volume":"8","author":"Barab\u00e1si","year":"2012","journal-title":"Nat. Phys."},{"issue":"10","key":"10.1016\/j.ins.2026.123522_bib0010","doi-asserted-by":"crossref","first-page":"9376","DOI":"10.1016\/j.jksuci.2022.09.016","article-title":"Identifying the influential nodes in complex social networks using centrality-based approach","volume":"34","author":"Ishfaq","year":"2022","journal-title":"J. King Saud Univ. - Comput. Inf. Sci."},{"issue":"1","key":"10.1016\/j.ins.2026.123522_bib0015","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1038\/s42005-021-00701-5","article-title":"Hidden network generating rules from partially observed complex networks","volume":"4","author":"Yang","year":"2021","journal-title":"Commun. Phys."},{"issue":"2","key":"10.1016\/j.ins.2026.123522_bib0020","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1109\/TNSE.2022.3223120","article-title":"Multi-objective optimization of transport processes on complex networks","volume":"10","author":"Wu","year":"2022","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"4\u20135","key":"10.1016\/j.ins.2026.123522_bib0025","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","article-title":"Complex networks: structure and dynamics","volume":"424","author":"Boccaletti","year":"2006","journal-title":"Phys. Rep."},{"issue":"6","key":"10.1016\/j.ins.2026.123522_bib0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103860","article-title":"Rank aggregation with limited information based on link prediction","volume":"61","author":"Li","year":"2024","journal-title":"Inf. Process. Manag."},{"key":"10.1016\/j.ins.2026.123522_bib0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.jairtraman.2024.102669","article-title":"Air route link prediction based on the PSO-CLP model","volume":"120","author":"Zhang","year":"2024","journal-title":"J. Air Transp. Manag."},{"key":"10.1016\/j.ins.2026.123522_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2022.112032","article-title":"Predicting user-item links in recommender systems based on similarity-network resource allocation","volume":"158","author":"Ai","year":"2022","journal-title":"Chaos Solit. Fractals"},{"issue":"2","key":"10.1016\/j.ins.2026.123522_bib0045","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1109\/JSYST.2014.2363161","article-title":"Toward a resilient holistic supply chain network system: concept, review and future direction","volume":"10","author":"Wang","year":"2014","journal-title":"IEEE Syst. J."},{"issue":"11","key":"10.1016\/j.ins.2026.123522_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.isci.2021.103217","article-title":"Progresses and challenges in link prediction","volume":"24","author":"Zhou","year":"2021","journal-title":"iScience"},{"issue":"1","key":"10.1016\/j.ins.2026.123522_bib0055","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1002\/asi.21664","article-title":"Link prediction in citation networks","volume":"63","author":"Shibata","year":"2012","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"10.1016\/j.ins.2026.123522_bib0060","series-title":"Proceedings of the Twelfth International Conference on Information and Knowledge Management","first-page":"556","article-title":"The link prediction problem for social networks","author":"Liben-Nowell","year":"2003"},{"key":"10.1016\/j.ins.2026.123522_bib0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2025.122051","article-title":"A general link prediction method based on path node information and source node information","author":"Kong","year":"2025","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123522_bib0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.126284","article-title":"Simplicial motif predictor method for higher-order link prediction","volume":"269","author":"Yang","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123522_bib0075","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.112616","article-title":"Link prediction in bipartite networks via deep autoencoder-like nonnegative matrix factorization","volume":"169","author":"Yu","year":"2025","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"10.1016\/j.ins.2026.123522_bib0080","doi-asserted-by":"crossref","first-page":"17201","DOI":"10.1109\/TITS.2022.3171451","article-title":"AARGNN: an attentive attributed recurrent graph neural network for traffic flow prediction considering multiple dynamic factors","volume":"23","author":"Chen","year":"2022","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"10.1016\/j.ins.2026.123522_bib0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2023.126441","article-title":"A survey of graph neural network based recommendation in social networks","volume":"549","author":"Li","year":"2023","journal-title":"Neurocomputing"},{"issue":"1","key":"10.1016\/j.ins.2026.123522_bib0090","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1186\/s40537-023-00876-4","article-title":"A review of graph neural networks: concepts, architectures, techniques, challenges, datasets, applications, and future directions","volume":"11","author":"Khemani","year":"2024","journal-title":"J. Big Data"},{"key":"10.1016\/j.ins.2026.123522_bib0095","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2024.102684","article-title":"SFGCN: synergetic fusion-based graph convolutional networks approach for link prediction in social networks","volume":"114","author":"Lee","year":"2025","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.ins.2026.123522_bib0100","doi-asserted-by":"crossref","DOI":"10.1109\/TNSE.2025.3526340","article-title":"Local optimization policy for link prediction via reinforcement learning","author":"Nie","year":"2025","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"3","key":"10.1016\/j.ins.2026.123522_bib0105","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104073","article-title":"Dual stream fusion link prediction for sparse graph based on variational graph autoencoder and pairwise learning","volume":"62","author":"Li","year":"2025","journal-title":"Inf. Process. Manag."},{"key":"10.1016\/j.ins.2026.123522_bib0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.125433","article-title":"Contrastive meta-reinforcement learning for heterogeneous graph neural architecture search","volume":"260","author":"Xu","year":"2025","journal-title":"Expert Syst. Appl."},{"issue":"12","key":"10.1016\/j.ins.2026.123522_bib0115","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/s10462-024-10998-7","article-title":"A survey on feature extraction and learning techniques for link prediction in homogeneous and heterogeneous complex networks","volume":"57","author":"Kapoor","year":"2024","journal-title":"Artif. Intell. Rev."},{"issue":"1","key":"10.1016\/j.ins.2026.123522_bib0120","doi-asserted-by":"crossref","DOI":"10.1063\/5.0293652","article-title":"Topological persistence pinpoints higher-order network vulnerabilities","volume":"36","author":"Xie","year":"2026","journal-title":"Chaos Interdiscip. J. Nonlinear Sci."},{"issue":"6","key":"10.1016\/j.ins.2026.123522_bib0125","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":"Zhou","year":"2011","journal-title":"Phys. a Stat. Mech. Appl."},{"key":"10.1016\/j.ins.2026.123522_bib0130","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s10115-014-0789-0","article-title":"Evaluating link prediction methods","volume":"45","author":"Yang","year":"2015","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.ins.2026.123522_bib0135","first-page":"32928","article-title":"Towards better evaluation for dynamic link prediction","volume":"35","author":"Poursafaei","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"9","key":"10.1016\/j.ins.2026.123522_bib0140","first-page":"5103","article-title":"Line graph neural networks for link prediction","volume":"44","author":"Cai","year":"2021","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"10.1016\/j.ins.2026.123522_bib0145","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/s12864-019-6413-7","article-title":"The advantages of the Matthews Correlation Coefficient (MCC) over F1 score and accuracy in binary classification evaluation","volume":"21","author":"Chicco","year":"2020","journal-title":"BMC Genom."},{"key":"10.1016\/j.ins.2026.123522_bib0150","author":"McDaid"},{"key":"10.1016\/j.ins.2026.123522_bib0155","series-title":"AAAI","article-title":"The network data repository with interactive graph analytics and visualization","author":"Rossi","year":"2015"},{"issue":"1815","key":"10.1016\/j.ins.2026.123522_bib0160","article-title":"Feeder use predicts both acquisition and transmission of a contagious pathogen in a North American songbird","volume":"282","author":"Adelman","year":"2015","journal-title":"Proc. R. Soc. B Biol. Sci."},{"key":"10.1016\/j.ins.2026.123522_bib0165","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1007\/s00265-016-2136-9","article-title":"Inferring social structure and its drivers from refuge use in the desert tortoise, a relatively solitary species","volume":"70","author":"Sah","year":"2016","journal-title":"Behav. Ecol. Sociobiol."},{"issue":"102","key":"10.1016\/j.ins.2026.123522_bib0170","doi-asserted-by":"crossref","DOI":"10.1098\/rsif.2014.1004","article-title":"Spatial analyses of wildlife contact networks","volume":"12","author":"Davis","year":"2015","journal-title":"J. R. Soc. Interface"},{"key":"10.1016\/j.ins.2026.123522_bib0175","series-title":"The pagerank citation ranking: bringing order to the web","author":"Page","year":"1999"},{"issue":"1","key":"10.1016\/j.ins.2026.123522_bib0180","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":"10.1016\/j.ins.2026.123522_bib0185","series-title":"Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"538","article-title":"SimRank: a measure of structural-context similarity","author":"Jeh","year":"2002"},{"key":"10.1016\/j.ins.2026.123522_bib0190","series-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"855","article-title":"node2vec: scalable feature learning for networks","author":"Grover","year":"2016"},{"key":"10.1016\/j.ins.2026.123522_bib0195","author":"Kipf"},{"key":"10.1016\/j.ins.2026.123522_bib0200","author":"Shu"},{"key":"10.1016\/j.ins.2026.123522_bib0205","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118737","article-title":"Link prediction approach combined graph neural network with capsule network","volume":"212","author":"Liu","year":"2023","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"10.1016\/j.ins.2026.123522_bib0210","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3625820","article-title":"Temporal link prediction: a unified framework, taxonomy, and review","volume":"56","author":"Qin","year":"2023","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.ins.2026.123522_bib0215","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.112045","article-title":"Mining node attributes for link prediction with a non-negative matrix factorization-based approach","volume":"299","author":"Zhao","year":"2024","journal-title":"Knowl.-based Syst."},{"issue":"5","key":"10.1016\/j.ins.2026.123522_bib0220","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2023.103418","article-title":"Meta-learning adaptation network for few-shot link prediction in heterogeneous social networks","volume":"60","author":"Wang","year":"2023","journal-title":"Inf. Process. Manag."},{"key":"10.1016\/j.ins.2026.123522_bib0225","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2020.102716","article-title":"Applications of link prediction in social networks: a review","volume":"166","author":"Daud","year":"2020","journal-title":"J. Netw. Comput. Appl."},{"key":"10.1016\/j.ins.2026.123522_bib0230","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2025.103308","article-title":"Fusion3M: community-based multi-scale co-evolving network for dynamic graph representation learning","volume":"123","author":"Li","year":"2025","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.ins.2026.123522_bib0235","first-page":"1","article-title":"Academic mentees thrive in big groups, but survive in small groups","author":"Xing","year":"2025","journal-title":"Nat. Hum. Behav."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004536?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004536?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:06:44Z","timestamp":1776438404000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526004536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":47,"alternative-id":["S0020025526004536"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123522","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A virtual node based zero-shot learning framework for link prediction in complex networks","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123522","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123522"}}