{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T08:01:28Z","timestamp":1781596888693,"version":"3.54.5"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"DOI":"10.1186\/s40537-025-01159-w","type":"journal-article","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T12:31:13Z","timestamp":1745325073000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Identifying influential nodes in weighted complex networks by considering the importance of shortest paths"],"prefix":"10.1186","volume":"12","author":[{"given":"Xiaohong","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"1159_CR1","doi-asserted-by":"publisher","first-page":"127195","DOI":"10.1016\/j.neucom.2023.127195","volume":"572","author":"E Zhu","year":"2024","unstructured":"Zhu E, Wang H, Zhang Y, Zhang K, Liu C. PHEE: identifying influential nodes in social networks with a phased evaluation-enhanced search. Neurocomputing. 2024;572:127195.","journal-title":"Neurocomputing"},{"key":"1159_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.chaos.2018.03.014","volume":"110","author":"K Berahmand","year":"2018","unstructured":"Berahmand K, Bouyer A, Samadi N. A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks. Chaos, Solitons & Fractals. 2018;110:41\u201354.","journal-title":"Chaos, Solitons & Fractals"},{"issue":"1","key":"1159_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3301286","volume":"52","author":"R Bian","year":"2019","unstructured":"Bian R, Koh YS, Dobbie G, Divoli A. Identifying top-k nodes in social networks: a survey. ACM Comput Surv (CSUR). 2019;52(1):1\u201333.","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"1","key":"1159_CR4","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TCSS.2024.3443746","volume":"12","author":"L Luo","year":"2024","unstructured":"Luo L, Tang Q, Ma Y, Rezaeipanah A. Semilocal average shortest path with augmented graph for identifying influential nodes. IEEE Trans Comput Social Syst. 2024;12(1):238\u201347.","journal-title":"IEEE Trans Comput Social Syst"},{"key":"1159_CR5","doi-asserted-by":"publisher","first-page":"102473","DOI":"10.1016\/j.jocs.2024.102473","volume":"84","author":"S Esfandiari","year":"2025","unstructured":"Esfandiari S, Moosavi MR. Identifying influential nodes in complex networks through the k-shell index and neighborhood information. J Comput Sci. 2025;84:102473.","journal-title":"J Comput Sci"},{"issue":"2","key":"1159_CR6","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1007\/s10489-021-02403-5","volume":"52","author":"S Kumar","year":"2022","unstructured":"Kumar S, Panda A. Identifying influential nodes in weighted complex networks using an improved wvoterank approach. Appl Intell. 2022;52(2):1838\u201352.","journal-title":"Appl Intell"},{"issue":"5","key":"1159_CR7","doi-asserted-by":"publisher","first-page":"103775","DOI":"10.1016\/j.ipm.2024.103775","volume":"61","author":"L Chen","year":"2024","unstructured":"Chen L, Xi Y, Dong L, Zhao M, Li C, Liu X, Cui X. Identifying influential nodes in complex networks via transformer. Inf Process Manag. 2024;61(5):103775.","journal-title":"Inf Process Manag"},{"key":"1159_CR8","doi-asserted-by":"crossref","unstructured":"Sharifi S. Enhancing kidney transplantation through multi-agent kidney exchange programs: A comprehensive review and optimization models. 2025. arXiv preprint arXiv:2502.07819.","DOI":"10.5267\/j.ijiec.2024.12.002"},{"key":"1159_CR9","unstructured":"Saberi-Movahed F, Berahmand K, Sheikhpour R, Li Y, Pan S. (2024). Nonnegative Matrix Factorization in Dimensionality Reduction: A Survey. arXiv preprint arXiv:2405.03615."},{"issue":"6","key":"1159_CR10","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1007\/s11424-021-0111-7","volume":"34","author":"Y Luan","year":"2021","unstructured":"Luan Y, Bao Z, Zhang H. Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths. J Syst Sci Complexity. 2021;34(6):2168\u201381.","journal-title":"J Syst Sci Complexity"},{"issue":"4\u20135","key":"1159_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S Boccaletti","year":"2006","unstructured":"Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU. Complex networks: structure and dynamics. Phys Rep. 2006;424(4\u20135):175\u2013308.","journal-title":"Phys Rep"},{"key":"1159_CR12","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.physa.2019.01.136","volume":"523","author":"Z Lv","year":"2019","unstructured":"Lv Z, Zhao N, Xiong F, Chen N. A novel measure of identifying influential nodes in complex networks. Physica A. 2019;523:488\u201397.","journal-title":"Physica A"},{"issue":"3","key":"1159_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC. Centrality in social networks conceptual clarification. Social Networks. 1978;1(3):215\u201339.","journal-title":"Social Networks"},{"issue":"16","key":"1159_CR14","doi-asserted-by":"publisher","first-page":"168702","DOI":"10.1103\/PhysRevLett.101.168702","volume":"101","author":"T Opsahl","year":"2008","unstructured":"Opsahl T, Colizza V, Panzarasa P, Ramasco JJ. Prominence and control: the weighted rich-club effect. Phys Rev Lett. 2008;101(16):168702.","journal-title":"Phys Rev Lett"},{"key":"1159_CR15","doi-asserted-by":"crossref","unstructured":"Freeman LC. (1977). A set of measures of centrality based on betweenness. Sociometry, 35\u201341.","DOI":"10.2307\/3033543"},{"issue":"12","key":"1159_CR16","first-page":"9","volume":"30","author":"JT Tang","year":"2008","unstructured":"Tang JT, Wang T. Research on the approximation algorithms for the betweenness property computation on complex social networks. Comput Eengineering Sci. 2008;30(12):9\u201318.","journal-title":"Comput Eengineering Sci"},{"issue":"4","key":"1159_CR17","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G. The centrality index of a graph. Psychometrika. 1966;31(4):581\u2013603.","journal-title":"Psychometrika"},{"issue":"4","key":"1159_CR18","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","volume":"391","author":"D Chen","year":"2012","unstructured":"Chen D, L\u00fc L, Shang MS, Zhang YC, Zhou T. Identifying influential nodes in complex networks. Physica A. 2012;391(4):1777\u201387.","journal-title":"Physica A"},{"key":"1159_CR19","doi-asserted-by":"publisher","first-page":"110882","DOI":"10.1016\/j.patcog.2024.110882","volume":"157","author":"R Sheikhpour","year":"2025","unstructured":"Sheikhpour R, Berahmand K, Mohammadi M, Khosravi H. Sparse feature selection using hypergraph Laplacian-based semi-supervised discriminant analysis. Pattern Recogn. 2025;157:110882.","journal-title":"Pattern Recogn"},{"issue":"11","key":"1159_CR20","doi-asserted-by":"publisher","first-page":"6989","DOI":"10.1109\/TKDE.2024.3389049","volume":"36","author":"K Berahmand","year":"2024","unstructured":"Berahmand K, Bahadori S, Abadeh MN, Li Y, Xu Y. SDAC-DA: Semi-supervised deep attributed clustering using dual autoencoder. IEEE Trans Knowl Data Eng. 2024;36(11):6989\u20137002.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1159_CR21","doi-asserted-by":"crossref","unstructured":"Hirsch JE. (2005). An index to quantify an individual\u2019s scientific research output. Proceedings of the National academy of Sciences, 102(46), 16569\u201316572.","DOI":"10.1073\/pnas.0507655102"},{"issue":"10","key":"1159_CR22","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.3390\/sym11101263","volume":"11","author":"L Gao","year":"2019","unstructured":"Gao L, Yu S, Li M, Shen Z, Gao Z. Weighted H-index for identifying influential spreaders. Symmetry. 2019;11(10):1263.","journal-title":"Symmetry"},{"issue":"11","key":"1159_CR23","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA. Identification of influential spreaders in complex networks. Nat Phys. 2010;6(11):888\u201393.","journal-title":"Nat Phys"},{"issue":"8","key":"1159_CR24","doi-asserted-by":"publisher","first-page":"083030","DOI":"10.1088\/1367-2630\/14\/8\/083030","volume":"14","author":"A Garas","year":"2012","unstructured":"Garas A, Schweitzer F, Havlin S. A k-shell decomposition method for weighted networks. New J Phys. 2012;14(8):083030.","journal-title":"New J Phys"},{"issue":"34","key":"1159_CR25","doi-asserted-by":"publisher","first-page":"2361","DOI":"10.1016\/j.physleta.2018.05.032","volume":"382","author":"F Yang","year":"2018","unstructured":"Yang F, Li X, Xu Y, Liu X, Wang J, Zhang Y, Yao Y. Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition. Phys Lett A. 2018;382(34):2361\u201371.","journal-title":"Phys Lett A"},{"issue":"1","key":"1159_CR26","doi-asserted-by":"publisher","first-page":"27823","DOI":"10.1038\/srep27823","volume":"6","author":"JX Zhang","year":"2016","unstructured":"Zhang JX, Chen DB, Dong Q, Zhao ZD. Identifying a set of influential spreaders in complex networks. Sci Rep. 2016;6(1):27823.","journal-title":"Sci Rep"},{"key":"1159_CR27","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.physa.2018.12.001","volume":"519","author":"HL Sun","year":"2019","unstructured":"Sun HL, Chen DB, He JL, Ch\u2019ng E. A voting approach to uncover multiple influential spreaders on weighted networks. Physica A. 2019;519:303\u201312.","journal-title":"Physica A"},{"key":"1159_CR28","doi-asserted-by":"publisher","first-page":"124215","DOI":"10.1016\/j.physa.2020.124215","volume":"553","author":"S Kumar","year":"2020","unstructured":"Kumar S, Panda BS. Identifying influential nodes in social networks: neighborhood coreness based voting approach. Physica A. 2020;553:124215.","journal-title":"Physica A"},{"key":"1159_CR29","doi-asserted-by":"publisher","first-page":"126708","DOI":"10.1016\/j.physa.2021.126708","volume":"591","author":"K Hajarathaiah","year":"2022","unstructured":"Hajarathaiah K, Enduri MK, Anamalamudi S. Efficient algorithm for finding the influential nodes using local relative change of average shortest path. Physica A. 2022;591:126708.","journal-title":"Physica A"},{"issue":"10","key":"1159_CR30","doi-asserted-by":"publisher","first-page":"101798","DOI":"10.1016\/j.jksuci.2023.101798","volume":"35","author":"K Zhang","year":"2023","unstructured":"Zhang K, Zhou Y, Long H, Wang C, Hong H, Armaghan SM. Towards identifying influential nodes in complex networks using semi-local centrality metrics. J King Saud University-Computer Inform Sci. 2023;35(10):101798.","journal-title":"J King Saud University-Computer Inform Sci"},{"issue":"5","key":"1159_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-024-10725-2","volume":"57","author":"Y Xiao","year":"2024","unstructured":"Xiao Y, Chen Y, Zhang H, Zhu X, Yang Y, Zhu X. A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood. Artif Intell Rev. 2024;57(5):1\u201321.","journal-title":"Artif Intell Rev"},{"key":"1159_CR32","doi-asserted-by":"publisher","first-page":"115843","DOI":"10.1016\/j.chaos.2024.115843","volume":"191","author":"B Meng","year":"2025","unstructured":"Meng B, Rezaeipanah A. Development of a multidimensional centrality metric for ranking nodes in complex networks. Chaos Solitons Fractals. 2025;191:115843.","journal-title":"Chaos Solitons Fractals"},{"key":"1159_CR33","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.physa.2015.12.162","volume":"451","author":"LL Ma","year":"2016","unstructured":"Ma LL, Ma C, Zhang HF, Wang BH. Identifying influential spreaders in complex networks based on gravity formula. Physica A. 2016;451:205\u201312.","journal-title":"Physica A"},{"key":"1159_CR34","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.physa.2016.10.086","volume":"468","author":"ZK Bao","year":"2017","unstructured":"Bao ZK, Ma C, Xiang BB, Zhang HF. Identification of influential nodes in complex networks: method from spreading probability viewpoint. Physica A. 2017;468:391\u20137.","journal-title":"Physica A"},{"issue":"11","key":"1159_CR35","doi-asserted-by":"publisher","first-page":"17841","DOI":"10.1109\/TITS.2024.3439699","volume":"25","author":"F An","year":"2024","unstructured":"An F, Wang J, Liu R. Road traffic sign recognition algorithm based on cascade attention-modulation fusion mechanism. IEEE Trans Intell Transp Syst. 2024;25(11):17841\u201351.","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1159_CR36","doi-asserted-by":"crossref","unstructured":"Rong, Y., Xu, Z., Liu, J., Liu, H., Ding, J., Liu, X.,\u2026 Gao, J. (2022). Du-bus:a realtime bus waiting time estimation system based on multi-source data. IEEE Transactions on Intelligent Transportation Systems, 23(12), 24524\u201324539.","DOI":"10.1109\/TITS.2022.3210170"},{"issue":"2","key":"1159_CR37","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1109\/MNET.2024.3350025","volume":"38","author":"P Chen","year":"2024","unstructured":"Chen P, Luo L, Guo D, Tang G, Zhao B, Li Y, Luo X. Why and how lasagna works: a new design of air-ground integrated infrastructure. IEEE Network. 2024;38(2):132\u201340.","journal-title":"IEEE Network"},{"issue":"4","key":"1159_CR38","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/MNET.2024.3413543","volume":"38","author":"Y Gong","year":"2024","unstructured":"Gong Y, Yao H, Nallanathan A. Intelligent sensing, communication, computation and caching for satellite-ground integrated networks. IEEE Network. 2024;38(4):9\u201316.","journal-title":"IEEE Network"},{"issue":"6","key":"1159_CR39","doi-asserted-by":"publisher","first-page":"4101","DOI":"10.1109\/TNSE.2022.3195862","volume":"9","author":"M Dai","year":"2022","unstructured":"Dai M, Luo L, Ren J, Yu H, Sun G. PSACCF: prioritized online slice admission control considering fairness in 5G\/B5G networks. IEEE Trans Netw Sci Eng. 2022;9(6):4101\u201314.","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"1159_CR40","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2024.3510561","author":"Y Fu","year":"2024","unstructured":"Fu Y, Dong M, Zhou L, Li C, Yu FR, Cheng N. A distributed incentive mechanism to balance demand and communication overhead for multiple federated learning tasks in IoV. IEEE Internet Things J. 2024. https:\/\/doi.org\/10.1109\/JIOT.2024.3510561.","journal-title":"IEEE Internet Things J"},{"issue":"10","key":"1159_CR41","doi-asserted-by":"publisher","first-page":"14140","DOI":"10.1109\/TWC.2024.3409691","volume":"23","author":"Y Gong","year":"2024","unstructured":"Gong Y, Yu D, Cheng X, Yuen C, Bennis M, Debbah M. Computation offloading and quantization schemes for federated satellite-ground graph networks. IEEE Trans Wireless Commun. 2024;23(10):14140\u201354.","journal-title":"IEEE Trans Wireless Commun"},{"issue":"10","key":"1159_CR42","doi-asserted-by":"publisher","first-page":"9708","DOI":"10.1109\/TMC.2024.3368331","volume":"23","author":"H Jiang","year":"2024","unstructured":"Jiang H, Ji P, Zhang T, Cao H, Liu D. Two-factor authentication for keyless entry system via finger-induced vibrations. IEEE Trans Mob Comput. 2024;23(10):9708\u201320.","journal-title":"IEEE Trans Mob Comput"},{"issue":"1","key":"1159_CR43","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1109\/TITS.2024.3488741","volume":"26","author":"J Xiao","year":"2024","unstructured":"Xiao J, Ren Y, Du J, Zhao Y, Kumari S, Alenazi MJ, Yu H. CALRA: practical conditional anonymous and leakage-resilient authentication scheme for vehicular crowdsensing communication. IEEE Trans Intell Transp Syst. 2024;26(1):1273\u201385.","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1159_CR44","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2024.3502464","author":"G Cheng","year":"2024","unstructured":"Cheng G, Xia J, Luo L, Mi H, Guo D, Ma RT. HyperPart: A Hypergraph-based abstraction for deduplicated storage systems. IEEE Trans Cloud Comput. 2024. https:\/\/doi.org\/10.1109\/TCC.2024.3502464.","journal-title":"IEEE Trans Cloud Comput"},{"issue":"3","key":"1159_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3507921","volume":"18","author":"X Zou","year":"2022","unstructured":"Zou X, Yuan J, Shilane P, Xia W, Zhang H, Wang X. From hyper-dimensional structures to linear structures: maintaining deduplicated data\u2019s locality. ACM Trans Storage (TOS). 2022;18(3):1\u201328.","journal-title":"ACM Trans Storage (TOS)"},{"issue":"1","key":"1159_CR46","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TMC.2017.2702613","volume":"17","author":"E Wang","year":"2017","unstructured":"Wang E, Yang Y, Wu J, Liu W, Wang X. An efficient prediction-based user recruitment for mobile crowdsensing. IEEE Trans Mob Comput. 2017;17(1):16\u201328.","journal-title":"IEEE Trans Mob Comput"},{"key":"1159_CR47","doi-asserted-by":"publisher","first-page":"113869","DOI":"10.1016\/j.jbusres.2023.113869","volume":"162","author":"W Duan","year":"2023","unstructured":"Duan W, Li C. Be alert to dangers: collapse and avoidance strategies of platform ecosystems. J Bus Res. 2023;162:113869.","journal-title":"J Bus Res"},{"issue":"18","key":"1159_CR48","doi-asserted-by":"publisher","first-page":"20481","DOI":"10.1007\/s11227-023-05439-1","volume":"79","author":"J Ding","year":"2023","unstructured":"Ding J, Chen X, Lu P, Yang Z, Li X, Du Y. DialogueINAB: an interaction neural network based on attitudes and behaviors of interlocutors for dialogue emotion recognition. J Supercomputing. 2023;79(18):20481\u2013514.","journal-title":"J Supercomputing"},{"key":"1159_CR49","doi-asserted-by":"crossref","unstructured":"Sheikhpour R, Mohammadi M, Berahmand K, Saberi-Movahed F, Khosravi H. Robust semi-supervised multi-label feature selection based on shared subspace and manifold learning. Inf Sci. 2025;699:121800.","DOI":"10.1016\/j.ins.2024.121800"},{"key":"1159_CR50","unstructured":"Berahmand K, Saberi-Movahed F, Sheikhpour R, Li Y, Jalili M. a comprehensive survey on spectral clustering with graph structure learning. 2025. arXiv preprint arXiv:2501.13597."},{"issue":"1","key":"1159_CR51","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s11235-024-01240-4","volume":"88","author":"P Han-huai","year":"2025","unstructured":"Han-huai P, Lin-wei W, Hao L, Abdollahi M. Identifying influential nodes in complex networks: a semi-local centrality measure based on augmented graph and average shortest path theory. Telecommunication Syst. 2025;88(1):25.","journal-title":"Telecommunication Syst"},{"issue":"2","key":"1159_CR52","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/TSC.2015.2477825","volume":"11","author":"G Sun","year":"2015","unstructured":"Sun G, Liao D, Zhao D, Xu Z, Yu H. Live migration for multiple correlated virtual machines in cloud-based data centers. IEEE Trans Serv Comput. 2015;11(2):279\u201391.","journal-title":"IEEE Trans Serv Comput"},{"key":"1159_CR53","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2400351","author":"Y Zhang","year":"2025","unstructured":"Zhang Y, Wang X, Gang Y, Wang J, Wu S, Zhang P, Shi Y. 6G SAGIN information transmission model. IEEE Commun Mag. 2025. https:\/\/doi.org\/10.1109\/MCOM.001.2400351.","journal-title":"IEEE Commun Mag"},{"issue":"7","key":"1159_CR54","doi-asserted-by":"publisher","first-page":"9411","DOI":"10.1109\/TVT.2024.3385776","volume":"73","author":"H Chu","year":"2024","unstructured":"Chu H, Pan X, Jiang J, Li X, Zheng L. Adaptive and robust channel Estimation for IRS-aided millimeter-wave communications. IEEE Trans Veh Technol. 2024;73(7):9411\u201323.","journal-title":"IEEE Trans Veh Technol"},{"issue":"16","key":"1159_CR55","doi-asserted-by":"publisher","first-page":"12505","DOI":"10.1109\/JIOT.2020.3019398","volume":"8","author":"Y Ding","year":"2020","unstructured":"Ding Y, Zhang W, Zhou X, Liao Q, Luo Q, Ni LM. FraudTrip: taxi fraudulent trip detection from corresponding trajectories. IEEE Internet Things J. 2020;8(16):12505\u201317.","journal-title":"IEEE Internet Things J"},{"issue":"2","key":"1159_CR56","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1109\/TIT.2023.3340147","volume":"70","author":"M Zhang","year":"2023","unstructured":"Zhang M, Wei E, Berry R, Huang J. Age-dependent differential privacy. IEEE Trans Inf Theory. 2023;70(2):1300\u201319.","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01159-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-025-01159-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01159-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T13:04:41Z","timestamp":1745327081000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-025-01159-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":56,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["1159"],"URL":"https:\/\/doi.org\/10.1186\/s40537-025-01159-w","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"7 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"100"}}