{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T11:41:40Z","timestamp":1782128500824,"version":"3.54.5"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T00:00:00Z","timestamp":1720483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T00:00:00Z","timestamp":1720483200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No. 6206201"],"award-info":[{"award-number":["No. 6206201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Longyuan Youth Innovation and Entrepreneurship Talents Team Project of Gansu","award":["No. 2021LQTD24"],"award-info":[{"award-number":["No. 2021LQTD24"]}]},{"name":"the Higher Education Innovation Fund project of Gansu","award":["No. 2022A-022"],"award-info":[{"award-number":["No. 2022A-022"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s12065-024-00958-z","type":"journal-article","created":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T15:22:41Z","timestamp":1720538561000},"page":"3793-3813","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Rb-based: link prediction based on the resource broadcast of nodes for complex networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Zeguang","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yabing","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhipeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,9]]},"reference":[{"issue":"11","key":"958_CR1","doi-asserted-by":"crossref","first-page":"103217","DOI":"10.1016\/j.isci.2021.103217","volume":"24","author":"T Zhou","year":"2021","unstructured":"Zhou T (2021) Progresses and challenges in link prediction. Iscience 24(11):103217","journal-title":"Iscience"},{"key":"958_CR2","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2023.129072","volume":"626","author":"S Forsberg","year":"2023","unstructured":"Forsberg S, Thomas K, Bergkvist M (2023) Power grid vulnerability analysis using complex network theory: a topological study of the nordic transmission grid. Phys A Stat Mech Appl 626:129072","journal-title":"Phys A Stat Mech Appl"},{"key":"958_CR3","volume":"610","author":"W Wang","year":"2023","unstructured":"Wang W, Wang Y, Wang G, Li M, Jia L (2023) Identification of the critical accident causative factors in the urban rail transit system by complex network theory. Phys A 610:128404","journal-title":"Phys A"},{"key":"958_CR4","volume":"592","author":"H Pu","year":"2022","unstructured":"Pu H, Li Y, Ma C (2022) Topology analysis of Lanzhou public transport network based on double-layer complex network theory. Phys A 592:126694","journal-title":"Phys A"},{"key":"958_CR5","volume":"573","author":"Z Wang","year":"2021","unstructured":"Wang Z, Rui X, Yuan G, Cui J, Hadzibeganovic T (2021) Endemic information-contagion outbreaks in complex networks with potential spreaders based recurrent-state transmission dynamics. Phys A 573:125907","journal-title":"Phys A"},{"issue":"4","key":"958_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2016","unstructured":"Mart\u00ednez V, Berzal F, Cubero J-C (2016) A survey of link prediction in complex networks. ACM Comput Surv (CSUR) 49(4):1\u201333","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"2","key":"958_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1109\/JETCAS.2017.2692243","volume":"7","author":"C-C Chu","year":"2017","unstructured":"Chu C-C, Iu HH-C (2017) Complex networks theory for modern smart grid applications: a survey. IEEE J Emerg Sel Top Circuits Syst 7(2):177\u2013191","journal-title":"IEEE J Emerg Sel Top Circuits Syst"},{"issue":"52","key":"958_CR8","doi-asserted-by":"crossref","first-page":"22073","DOI":"10.1073\/pnas.0908366106","volume":"106","author":"R Guimer\u00e0","year":"2009","unstructured":"Guimer\u00e0 R, Sales-Pardo M (2009) Missing and spurious interactions and the reconstruction of complex networks. Proc Natl Acad Sci 106(52):22073\u201322078","journal-title":"Proc Natl Acad Sci"},{"key":"958_CR9","volume":"239","author":"X Fu","year":"2023","unstructured":"Fu X, Li Q, Li W (2023) Modeling and analysis of industrial IoT reliability to cascade failures: An information-service coupling perspective. Reliab Eng Syst Saf 239:109517","journal-title":"Reliab Eng Syst Saf"},{"key":"958_CR10","volume":"634","author":"X Fu","year":"2024","unstructured":"Fu X, Xu X, Li W (2024) Cascading failure resilience analysis and recovery of automotive manufacturing supply chain networks considering enterprise roles. Phys A 634:129478","journal-title":"Phys A"},{"issue":"4","key":"958_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3579847","volume":"23","author":"X Fu","year":"2023","unstructured":"Fu X, Pace P, Aloi G, Guerrieri A, Li W, Fortino G (2023) Tolerance analysis of cyber-manufacturing systems to cascading failures. ACM Trans Internet Technol 23(4):1\u201323","journal-title":"ACM Trans Internet Technol"},{"issue":"1","key":"958_CR12","first-page":"1","volume":"58","author":"P Wang","year":"2015","unstructured":"Wang P, Xu B, Wu Y, Zhou X (2015) Link prediction in social networks: the state-of-the-art. Sci China Inf Sci 58(1):1\u201338","journal-title":"Sci China Inf Sci"},{"issue":"7","key":"958_CR13","doi-asserted-by":"crossref","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"},{"key":"958_CR14","volume":"139","author":"S Li","year":"2020","unstructured":"Li S, Song X, Lu H, Zeng L, Shi M, Liu F (2020) Friend recommendation for cross marketing in online brand community based on intelligent attention allocation link prediction algorithm. Expert Syst Appl 139:112839","journal-title":"Expert Syst Appl"},{"key":"958_CR15","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"},{"issue":"1","key":"958_CR16","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/j.aej.2021.04.081","volume":"61","author":"G Liu","year":"2022","unstructured":"Liu G (2022) An ecommerce recommendation algorithm based on link prediction. Alex Eng J 61(1):905\u2013910","journal-title":"Alex Eng J"},{"key":"958_CR17","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":"958_CR18","doi-asserted-by":"crossref","unstructured":"Pulipati S, Somula R, Parvathala BR (2021) Nature inspired link prediction and community detection algorithms for social networks: a survey. Int J Syst Assur Eng Manag 1\u201318","DOI":"10.1007\/s13198-021-01125-8"},{"key":"958_CR19","doi-asserted-by":"crossref","DOI":"10.1016\/j.cosrev.2020.100247","volume":"37","author":"HD Bedru","year":"2020","unstructured":"Bedru HD, Yu S, Xiao X, Zhang D, Wan L, Guo H, Xia F (2020) Big networks: a survey. Comput Sci Rev 37:100247","journal-title":"Comput Sci Rev"},{"issue":"6","key":"958_CR20","doi-asserted-by":"crossref","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"},{"issue":"3","key":"958_CR21","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s41019-022-00188-2","volume":"7","author":"H Wu","year":"2022","unstructured":"Wu H, Song C, Ge Y, Ge T (2022) Link prediction on complex networks: an experimental survey. Data Sci Eng 7(3):253\u2013278","journal-title":"Data Sci Eng"},{"issue":"3","key":"958_CR22","doi-asserted-by":"crossref","first-page":"38002","DOI":"10.1209\/0295-5075\/117\/38002","volume":"117","author":"R Pech","year":"2017","unstructured":"Pech R, Hao D, Pan L, Cheng H, Zhou T (2017) Link prediction via matrix completion. Europhys Lett 117(3):38002","journal-title":"Europhys Lett"},{"key":"958_CR23","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou T, L\u00fc L, Zhang Y-C (2009) Predicting missing links via local information. Eur Phys J B 71:623\u2013630","journal-title":"Eur Phys J B"},{"key":"958_CR24","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"},{"issue":"1987","key":"958_CR25","doi-asserted-by":"crossref","first-page":"20120375","DOI":"10.1098\/rsta.2012.0375","volume":"371","author":"A-L Barab\u00e1si","year":"2013","unstructured":"Barab\u00e1si A-L (2013) Network science. Philos Trans R Soc A Math Phys Eng Sci 371(1987):20120375","journal-title":"Philos Trans R Soc A Math Phys Eng Sci"},{"key":"958_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2018.05.002","volume":"750","author":"Z-M Ren","year":"2018","unstructured":"Ren Z-M, Zeng A, Zhang Y-C (2018) Structure-oriented prediction in complex networks. Phys Rep 750:1\u201351","journal-title":"Phys Rep"},{"key":"958_CR27","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.122950","volume":"539","author":"S Rafiee","year":"2020","unstructured":"Rafiee S, Salavati C, Abdollahpouri A (2020) Cndp: link prediction based on common neighbors degree penalization. Phys A 539:122950","journal-title":"Phys A"},{"issue":"3","key":"958_CR28","doi-asserted-by":"crossref","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":"958_CR29","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.ins.2019.01.023","volume":"483","author":"S Bag","year":"2019","unstructured":"Bag S, Kumar SK, Tiwari MK (2019) An efficient recommendation generation using relevant Jaccard similarity. Inf Sci 483:53\u201364","journal-title":"Inf Sci"},{"key":"958_CR30","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2024.129552","volume":"637","author":"M Charikhi","year":"2024","unstructured":"Charikhi M (2024) Association of the Pagerank algorithm with similarity-based methods for link prediction in complex networks. Phys A 637:129552","journal-title":"Phys A"},{"issue":"1","key":"958_CR31","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343","journal-title":"Psychometrika"},{"issue":"1","key":"958_CR32","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"DJ Klein","year":"1993","unstructured":"Klein DJ, Randi\u0107 M (1993) Resistance distance. J Math Chem 12(1):81\u201395","journal-title":"J Math Chem"},{"issue":"1\u20137","key":"958_CR33","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"key":"958_CR34","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2023.128694","volume":"618","author":"Y Jiao","year":"2023","unstructured":"Jiao Y, Wu J, Xiang P, Wang F (2023) Link prediction from fusion information. Phys A 618:128694","journal-title":"Phys A"},{"issue":"5","key":"958_CR35","doi-asserted-by":"crossref","first-page":"58007","DOI":"10.1209\/0295-5075\/89\/58007","volume":"89","author":"W Liu","year":"2010","unstructured":"Liu W, L\u00fc L (2010) Link prediction based on local random walk. EPL (Europhys Lett) 89(5):58007","journal-title":"EPL (Europhys Lett)"},{"key":"958_CR36","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2020.124980","volume":"557","author":"F Aziz","year":"2020","unstructured":"Aziz F, Gul H, Muhammad I, Uddin I (2020) Link prediction using node information on local paths. Phys A 557:124980","journal-title":"Phys A"},{"issue":"7191","key":"958_CR37","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A Clauset","year":"2008","unstructured":"Clauset A, Moore C, Newman ME (2008) Hierarchical structure and the prediction of missing links in networks. Nature 453(7191):98\u2013101","journal-title":"Nature"},{"issue":"1","key":"958_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41109-019-0170-z","volume":"4","author":"N Stanley","year":"2019","unstructured":"Stanley N, Bonacci T, Kwitt R, Niethammer M, Mucha PJ (2019) Stochastic block models with multiple continuous attributes. Appl Netw Sci 4(1):1\u201322","journal-title":"Appl Netw Sci"},{"issue":"1","key":"958_CR39","doi-asserted-by":"crossref","first-page":"22955","DOI":"10.1038\/srep22955","volume":"6","author":"L Pan","year":"2016","unstructured":"Pan L, Zhou T, L\u00fc L, Hu C-K (2016) Predicting missing links and identifying spurious links via likelihood analysis. Sci Rep 6(1):22955","journal-title":"Sci Rep"},{"key":"958_CR40","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.jspi.2021.04.003","volume":"215","author":"S Gaucher","year":"2021","unstructured":"Gaucher S, Klopp O (2021) Maximum likelihood estimation of sparse networks with missing observations. J Stat Plan Inference 215:299\u2013329","journal-title":"J Stat Plan Inference"},{"issue":"2","key":"958_CR41","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.104.024301","volume":"104","author":"J Kuang","year":"2021","unstructured":"Kuang J, Scoglio C (2021) Layer reconstruction and missing link prediction of a multilayer network with maximum a posteriori estimation. Phys Rev E 104(2):024301","journal-title":"Phys Rev E"},{"key":"958_CR42","unstructured":"Zhao H, Du L, Buntine W (2017) Leveraging node attributes for incomplete relational data. In: International conference on machine learning. PMLR, pp 4072\u20134081"},{"issue":"8","key":"958_CR43","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30\u201337","journal-title":"Computer"},{"key":"958_CR44","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.knosys.2017.09.020","volume":"137","author":"W Wang","year":"2017","unstructured":"Wang W, Feng Y, Jiao P, Yu W (2017) Kernel framework based on non-negative matrix factorization for networks reconstruction and link prediction. Knowl-Based Syst 137:104\u2013114","journal-title":"Knowl-Based Syst"},{"key":"958_CR45","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115991","volume":"188","author":"G Chen","year":"2022","unstructured":"Chen G, Wang H, Fang Y, Jiang L (2022) Link prediction by deep non-negative matrix factorization. Expert Syst Appl 188:115991","journal-title":"Expert Syst Appl"},{"issue":"1","key":"958_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-016-0001-8","volume":"6","author":"W Wang","year":"2016","unstructured":"Wang W, Cai F, Jiao P, Pan L (2016) A perturbation-based framework for link prediction via non-negative matrix factorization. Sci Rep 6(1):1\u201311","journal-title":"Sci Rep"},{"key":"958_CR47","volume":"539","author":"G Chen","year":"2020","unstructured":"Chen G, Xu C, Wang J, Feng J, Feng J (2020) Robust non-negative matrix factorization for link prediction in complex networks using manifold regularization and sparse learning. Phys A 539:122882","journal-title":"Phys A"},{"key":"958_CR48","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining. pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"958_CR49","unstructured":"Mikolov T, Chen K, Corrado G, Dean J (2013) Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781"},{"key":"958_CR50","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"958_CR51","doi-asserted-by":"crossref","unstructured":"Wu E, Cui H, Chen Z (2022) Relpnet: relation-based link prediction neural network. In: Proceedings of the 31st ACM international conference on information & knowledge management. pp 2138\u20132147","DOI":"10.1145\/3511808.3557430"},{"key":"958_CR52","doi-asserted-by":"crossref","unstructured":"Zhang M, Chen Y (2017) Weisfeiler-Lehman neural machine for link prediction. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. pp 575\u2013583","DOI":"10.1145\/3097983.3097996"},{"key":"958_CR53","unstructured":"Zhang M, Chen Y (2018) Link prediction based on graph neural networks. Adv Neural Inf Process Syst 31"},{"issue":"8","key":"958_CR54","doi-asserted-by":"crossref","first-page":"3653","DOI":"10.1109\/TNNLS.2020.3015896","volume":"32","author":"Z Wang","year":"2020","unstructured":"Wang Z, Lei Y, Li W (2020) Neighborhood attention networks with adversarial learning for link prediction. IEEE Trans Neural Netw Learn Syst 32(8):3653\u20133663","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"958_CR55","doi-asserted-by":"crossref","unstructured":"Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the AAAI conference on artificial intelligence, vol 29","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"1","key":"958_CR56","doi-asserted-by":"crossref","first-page":"1613","DOI":"10.1038\/srep01613","volume":"3","author":"CV Cannistraci","year":"2013","unstructured":"Cannistraci CV, Alanis-Lobato G, Ravasi T (2013) From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks. Sci Rep 3(1):1613","journal-title":"Sci Rep"},{"issue":"4","key":"958_CR57","doi-asserted-by":"crossref","first-page":"48007","DOI":"10.1209\/0295-5075\/96\/48007","volume":"96","author":"Z Liu","year":"2011","unstructured":"Liu Z, Zhang Q-M, L\u00fc L, Zhou T (2011) Link prediction in complex networks: a local na\u00efve bayes model. Europhys Lett 96(4):48007","journal-title":"Europhys Lett"},{"key":"958_CR58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1140\/epjb\/s10051-020-00008-4","volume":"94","author":"M Wang","year":"2021","unstructured":"Wang M, Lou X, Cui B (2021) A degree-related and link clustering coefficient approach for link prediction in complex networks. Eur Phys J B 94:1\u201312","journal-title":"Eur Phys J B"},{"issue":"1","key":"958_CR59","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","volume":"143","author":"JA Hanley","year":"1982","unstructured":"Hanley JA, McNeil BJ (1982) The meaning and use of the area under a receiver operating characteristic (roc) curve. Radiology 143(1):29\u201336","journal-title":"Radiology"},{"issue":"1","key":"958_CR60","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/963770.963772","volume":"22","author":"JL Herlocker","year":"2004","unstructured":"Herlocker JL, Konstan JA, Terveen LG, Riedl JT (2004) Evaluating collaborative filtering recommender systems. ACM Trans Inf Syst (TOIS) 22(1):5\u201353","journal-title":"ACM Trans Inf Syst (TOIS)"},{"issue":"8","key":"958_CR61","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett T (2006) An introduction to roc analysis. Pattern Recogn Lett 27(8):861\u2013874","journal-title":"Pattern Recogn Lett"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00958-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-024-00958-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00958-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T06:18:59Z","timestamp":1729318739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-024-00958-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,9]]},"references-count":61,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["958"],"URL":"https:\/\/doi.org\/10.1007\/s12065-024-00958-z","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,9]]},"assertion":[{"value":"24 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"In our research, we emphasize the importance of ethical practices and informed consent in the acquisition and utilization of data. Firstly, we obtain the dataset used in our study following strict ethical guidelines. The data is sourced from , and we ensure that the data is anonymized and stripped of any personally identifiable information to protect the privacy and confidentiality of the individuals or entities involved. Furthermore, we highlight the significance of informed consent in the process of data usage. As the data used in our study is pre-existing and publicly available, we adhere to the ethical standards and legal requirements set forth by the data source. It is important to emphasize that our research aligns with the principles of research ethics and integrity, complying with all regulations and guidelines related to data acquisition, storage, and usage. We acknowledge the importance of responsible data handling and are committed to maintaining the confidentiality and privacy of the data subjects.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"We declare that there are no conflict of interest in this work. Throughout the research process, we have not encountered any conflict of interest that could have influenced the research outcomes. We are committed to upholding the highest standards of research ethics and integrity.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}