{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:57:45Z","timestamp":1781225865319,"version":"3.54.1"},"reference-count":57,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"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":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.knosys.2026.116012","type":"journal-article","created":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T16:12:07Z","timestamp":1776701527000},"page":"116012","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Contrastive sensitivity learning for unsupervised node importance evaluation in complex networks"],"prefix":"10.1016","volume":"343","author":[{"given":"Yiming","family":"Dai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Fu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6321-2129","authenticated-orcid":false,"given":"Bin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.116012_b1","series-title":"Networks: An Introduction","author":"Newman","year":"2010"},{"issue":"5","key":"10.1016\/j.knosys.2026.116012_b2","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1086\/228631","article-title":"Power and centrality: A family of measures","volume":"92","author":"Bonacich","year":"1987","journal-title":"Am. J. Sociol."},{"issue":"1\u20137","key":"10.1016\/j.knosys.2026.116012_b3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Comput. Netw. ISDN Syst."},{"issue":"1","key":"10.1016\/j.knosys.2026.116012_b4","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.knosys.2026.116012_b5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/35075138","article-title":"Lethality and centrality in protein networks","volume":"411","author":"Jeong","year":"2001","journal-title":"Nature"},{"issue":"11","key":"10.1016\/j.knosys.2026.116012_b6","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","article-title":"Identification of influential spreaders in complex networks","volume":"6","author":"Kitsak","year":"2010","journal-title":"Nat. Phys."},{"issue":"6794","key":"10.1016\/j.knosys.2026.116012_b7","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"Albert","year":"2000","journal-title":"Nature"},{"issue":"3","key":"10.1016\/j.knosys.2026.116012_b8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1979","journal-title":"Soc. Netw."},{"issue":"5","key":"10.1016\/j.knosys.2026.116012_b9","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","article-title":"Authoritative sources in a hyperlinked environment","volume":"46","author":"Kleinberg","year":"1999","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.knosys.2026.116012_b10","doi-asserted-by":"crossref","first-page":"24676","DOI":"10.1038\/srep24676","article-title":"Predicting the epidemic threshold of the susceptible-infected-recovered model","volume":"6","author":"Wang","year":"2016","journal-title":"Sci. Rep."},{"key":"10.1016\/j.knosys.2026.116012_b11","series-title":"Advances in Neural Information Processing Systems (NeurIPS)","first-page":"1","article-title":"Inductive representation learning on large graphs","volume":"vol. 30","author":"Hamilton","year":"2017"},{"key":"10.1016\/j.knosys.2026.116012_b12","series-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"10.1016\/j.knosys.2026.116012_b13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","article-title":"Graph neural networks: A review of methods and applications","volume":"1","author":"Zhou","year":"2020","journal-title":"AI Open"},{"issue":"6","key":"10.1016\/j.knosys.2026.116012_b14","doi-asserted-by":"crossref","first-page":"114","DOI":"10.23919\/JCC.2021.06.010","article-title":"Node ranking strategy in virtual network embedding: An overview","volume":"18","author":"Wu","year":"2021","journal-title":"China Commun."},{"issue":"3","key":"10.1016\/j.knosys.2026.116012_b15","doi-asserted-by":"crossref","first-page":"4462","DOI":"10.1109\/TNNLS.2024.3363695","article-title":"Label informed contrastive pretraining for node importance estimation on knowledge graphs","volume":"36","author":"Zhang","year":"2024","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.knosys.2026.116012_b16","doi-asserted-by":"crossref","first-page":"2022","DOI":"10.1109\/TNSE.2025.3608483","article-title":"Node importance estimation via multi-view graph prompting","volume":"13","author":"Ma","year":"2026","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"10.1016\/j.knosys.2026.116012_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.114521","article-title":"Node importance estimation leveraging llms for semantic augmentation in knowledge graphs","volume":"330","author":"Lin","year":"2025","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.116012_b18","series-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"issue":"1","key":"10.1016\/j.knosys.2026.116012_b19","doi-asserted-by":"crossref","DOI":"10.1155\/2023\/5917750","article-title":"Node importance estimation with multiview contrastive representation learning","volume":"2023","author":"Liu","year":"2023","journal-title":"Int. J. Intell. Syst."},{"key":"10.1016\/j.knosys.2026.116012_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.129555","article-title":"Node importance evaluation in heterogeneous network based on attention mechanism and graph contrastive learning","volume":"626","author":"Shu","year":"2025","journal-title":"Neurocomputing"},{"key":"10.1016\/j.knosys.2026.116012_b21","doi-asserted-by":"crossref","unstructured":"P. Brodka, K. Skibicki, P. Kazienko, K. Musial, A degree centrality in multi-layered social network, in: Proceedings of the 2011 International Conference on Computational Aspects of Social Networks (CASoN), 2011, pp. 237\u2013242.","DOI":"10.1109\/CASON.2011.6085951"},{"issue":"2","key":"10.1016\/j.knosys.2026.116012_b22","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1140\/epjb\/e2004-00111-4","article-title":"Betweenness centrality in large complex networks","volume":"38","author":"Barth\u00e9lemy","year":"2004","journal-title":"Eur. Phys. J. B"},{"key":"10.1016\/j.knosys.2026.116012_b23","doi-asserted-by":"crossref","unstructured":"E. Cohen, D. Delling, T. Pajor, R.F. Werneck, Computing classic closeness centrality, at scale, in: Proceedings of the Second ACM Conference on Online Social Networks, COSN, 2014, pp. 37\u201350.","DOI":"10.1145\/2660460.2660465"},{"issue":"3","key":"10.1016\/j.knosys.2026.116012_b24","doi-asserted-by":"crossref","DOI":"10.1063\/1.4818544","article-title":"Eigenvector centrality of nodes in multiplex networks","volume":"23","author":"Sol\u00e1","year":"2013","journal-title":"Chaos: An Interdiscip. J. Nonlinear Sci."},{"key":"10.1016\/j.knosys.2026.116012_b25","article-title":"The pagerank citation ranking: Bringing order to the web","author":"Page","year":"1999"},{"issue":"14","key":"10.1016\/j.knosys.2026.116012_b26","doi-asserted-by":"crossref","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","article-title":"Epidemic spreading in scale-free networks","volume":"86","author":"Pastor-Satorras","year":"2001","journal-title":"Phys. Rev. Lett."},{"issue":"7563","key":"10.1016\/j.knosys.2026.116012_b27","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1038\/nature14604","article-title":"Influence maximization in complex networks through optimal percolation","volume":"524","author":"Morone","year":"2015","journal-title":"Nature"},{"issue":"5","key":"10.1016\/j.knosys.2026.116012_b28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3446217","article-title":"Graph neural networks for fast node ranking approximation","volume":"15","author":"Maurya","year":"2021","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.knosys.2026.116012_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2023.129339","article-title":"Gnr: A universal and efficient node ranking model for various tasks based on graph neural networks","volume":"632","author":"Qu","year":"2023","journal-title":"Phys. A"},{"key":"10.1016\/j.knosys.2026.116012_b30","series-title":"Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking","author":"Bojchevski","year":"2017"},{"key":"10.1016\/j.knosys.2026.116012_b31","series-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"10.1016\/j.knosys.2026.116012_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2024.115388","article-title":"Node ranking algorithm using graph convolutional networks and mini-batch training","volume":"187","author":"Li","year":"2024","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.knosys.2026.116012_b33","unstructured":"T. Chen, S. Kornblith, M. Norouzi, G. Hinton, A simple framework for contrastive learning of visual representations, in: Proceedings of the 37th International Conference on Machine Learning, ICML, 2020, pp. 1597\u20131607."},{"key":"10.1016\/j.knosys.2026.116012_b34","doi-asserted-by":"crossref","unstructured":"K. He, H. Fan, Y. Wu, S. Xie, R. Girshick, Momentum contrast for unsupervised visual representation learning, in: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, CVPR, 2020, pp. 9729\u20139738.","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"10.1016\/j.knosys.2026.116012_b35","series-title":"Advances in Neural Information Processing Systems","first-page":"21271","article-title":"Bootstrap your own latent: A new approach to self-supervised learning","volume":"vol. 33","author":"Grill","year":"2020"},{"key":"10.1016\/j.knosys.2026.116012_b36","series-title":"Deep graph contrastive representation learning","author":"Zhu","year":"2020"},{"key":"10.1016\/j.knosys.2026.116012_b37","series-title":"Advances in Neural Information Processing Systems","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"vol. 33","author":"You","year":"2020"},{"key":"10.1016\/j.knosys.2026.116012_b38","doi-asserted-by":"crossref","unstructured":"Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, L. Wang, Graph contrastive learning with adaptive augmentation, in: Proceedings of the Web Conference 2021, 2021, pp. 2069\u20132080.","DOI":"10.1145\/3442381.3449802"},{"key":"10.1016\/j.knosys.2026.116012_b39","unstructured":"S. Tan, D. Li, R. Jiang, Y. Zhang, M. Okumura, Community-invariant graph contrastive learning, in: Proceedings of the 41st International Conference on Machine Learning, 2024."},{"key":"10.1016\/j.knosys.2026.116012_b40","unstructured":"K. Hassani, A.H. Khasahmadi, Contrastive multi-view representation learning on graphs, in: International Conference on Machine Learning, 2020, pp. 4116\u20134126."},{"key":"10.1016\/j.knosys.2026.116012_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120780","article-title":"Dismantling complex networks with graph contrastive learning and multi-hop aggregation","volume":"676","author":"Ma","year":"2024","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2026.116012_b42","series-title":"Deep graph infomax","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"10.1016\/j.knosys.2026.116012_b43","doi-asserted-by":"crossref","unstructured":"S. Tan, J. You, D. Li, Temporality- and frequency-aware graph contrastive learning for temporal network, in: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022, pp. 1878\u20131888.","DOI":"10.1145\/3511808.3557469"},{"key":"10.1016\/j.knosys.2026.116012_b44","doi-asserted-by":"crossref","unstructured":"D. Li, S. Tan, Y. Wang, K. Funakoshi, M. Okumura, Temporal and topological augmentation-based cross-view contrastive learning model for temporal link prediction, in: Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023, pp. 4059\u20134063.","DOI":"10.1145\/3583780.3615231"},{"key":"10.1016\/j.knosys.2026.116012_b45","doi-asserted-by":"crossref","unstructured":"C. Ji, Z. Huang, Q. Sun, H. Peng, X. Fu, Q. Li, J. Li, Regcl: Rethinking message passing in graph contrastive learning, in: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, 2024, pp. 8544\u20138552.","DOI":"10.1609\/aaai.v38i8.28698"},{"key":"10.1016\/j.knosys.2026.116012_b46","doi-asserted-by":"crossref","unstructured":"Y. Chen, D. Guan, W. Yuan, T. Zang, Beyond homophily: Graph contrastive learning with macro\u2013micro message passing, in: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 39, 2025, pp. 15948\u201315956.","DOI":"10.1609\/aaai.v39i15.33751"},{"key":"10.1016\/j.knosys.2026.116012_b47","doi-asserted-by":"crossref","unstructured":"J. Wang, Y. Song, Y. Gu, X. Li, F. Li, Clnie: A contrastive learning based node importance evaluation method for knowledge graphs with few labels, in: International Conference on Database Systems for Advanced Applications, 2023, pp. 689\u2013705.","DOI":"10.1007\/978-3-031-30672-3_46"},{"key":"10.1016\/j.knosys.2026.116012_b48","article-title":"Multi-structural view knowledge distillation for node influence prediction in complex networks","author":"Ahmadi","year":"2025","journal-title":"Exp. Syst. Appl."},{"issue":"1","key":"10.1016\/j.knosys.2026.116012_b49","first-page":"2095","article-title":"The identification of influential users based on semi-supervised contrastive learning","volume":"85","author":"Zhang","year":"2025","journal-title":"Comput. Mater. Contin."},{"key":"10.1016\/j.knosys.2026.116012_b50","series-title":"Clgnn: a contrastive learning-based gnn model for betweenness centrality prediction on temporal graphs","author":"Zhang","year":"2025"},{"key":"10.1016\/j.knosys.2026.116012_b51","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.neucom.2022.05.010","article-title":"A new approach for evaluating node importance in complex networks via deep learning methods","volume":"497","author":"Zhang","year":"2022","journal-title":"Neurocomputing"},{"issue":"5","key":"10.1016\/j.knosys.2026.116012_b52","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103775","article-title":"Identifying influential nodes in complex networks via transformer","volume":"61","author":"Chen","year":"2024","journal-title":"Inf. Process. Manage."},{"issue":"2","key":"10.1016\/j.knosys.2026.116012_b53","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.fmre.2024.06.013","article-title":"Graph contrastive learning with node-level accurate difference","volume":"5","author":"Jiao","year":"2025","journal-title":"Fundam. Res."},{"key":"10.1016\/j.knosys.2026.116012_b54","series-title":"Low-rank graph contrastive learning for node classification","author":"Wang","year":"2024"},{"key":"10.1016\/j.knosys.2026.116012_b55","series-title":"Graph ranking contrastive learning: An extremely simple yet efficient method","author":"Hu","year":"2023"},{"issue":"1","key":"10.1016\/j.knosys.2026.116012_b56","doi-asserted-by":"crossref","first-page":"16404","DOI":"10.1038\/s41598-023-43585-x","article-title":"Identifying influential nodes in complex networks using a gravity model based on the h-index method","volume":"13","author":"Zhu","year":"2023","journal-title":"Sci. Rep."},{"issue":"11","key":"10.1016\/j.knosys.2026.116012_b57","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s10586-025-05448-0","article-title":"Hhgnn: A novel framework for node influence ranking in heterogeneous networks","volume":"28","author":"Han","year":"2025","journal-title":"Clust. Comput."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126007380?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126007380?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:06:20Z","timestamp":1781222780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126007380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":57,"alternative-id":["S0950705126007380"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116012","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Contrastive sensitivity learning for unsupervised node importance evaluation in complex networks","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116012"}}