{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T19:17:33Z","timestamp":1771269453221,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2021,4,4]],"date-time":"2021-04-04T00:00:00Z","timestamp":1617494400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,4]],"date-time":"2021-04-04T00:00:00Z","timestamp":1617494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key R&D Program of China","award":["2020YFC0832500"],"award-info":[{"award-number":["2020YFC0832500"]}]},{"name":"Ministry of Education - China Mobile Research Foundation","award":["MCM20170206"],"award-info":[{"award-number":["MCM20170206"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402210"],"award-info":[{"award-number":["61402210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Plan of Qinghai Province","award":["2020-GX-164"],"award-info":[{"award-number":["2020-GX-164"]}]},{"name":"National Social Science Fund Project under Grant","award":["20XTJ005"],"award-info":[{"award-number":["20XTJ005"]}]},{"name":"State Grid Corporation of China Science and Technology Project","award":["SGGSKY00WYJS2000062"],"award-info":[{"award-number":["SGGSKY00WYJS2000062"]}]},{"name":"Strategic Priority Research Program of the Chinese Academy of Sciences","award":["XDA03030100"],"award-info":[{"award-number":["XDA03030100"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00500-021-05749-7","type":"journal-article","created":{"date-parts":[[2021,4,4]],"date-time":"2021-04-04T12:02:20Z","timestamp":1617537740000},"page":"8223-8240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A clique-based discrete bat algorithm for influence maximization in identifying top-k influential nodes of social networks"],"prefix":"10.1007","volume":"25","author":[{"given":"Lihong","family":"Han","sequence":"first","affiliation":[]},{"given":"Kuan-Ching","family":"Li","sequence":"additional","affiliation":[]},{"given":"Arcangelo","family":"Castiglione","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Hengjun","family":"Huang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3955-7765","authenticated-orcid":false,"given":"Qingguo","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,4]]},"reference":[{"key":"5749_CR1","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.eswa.2018.07.038","volume":"114","author":"KR Aybike\u015e\u0130M\u015eEK","year":"2018","unstructured":"Aybike\u015e\u0130M\u015eEK KR (2018) Using swarm intelligence algorithms to detect influential individuals for influence maximization in social networks. Expert Syst Appl 114:224\u2013236","journal-title":"Expert Syst Appl"},{"key":"5749_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-020-00517-4","author":"K Bi","year":"2020","unstructured":"Bi K, Han D, Zhang G, Li K-C, Castiglione A (2020) K maximum probability attack paths generation algorithm for target nodes in networked systems. Int J Inf Secur. https:\/\/doi.org\/10.1007\/s10207-020-00517-4","journal-title":"Int J Inf Secur"},{"key":"5749_CR3","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"V Blondel","year":"2008","unstructured":"Blondel V, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of community in large networks. J Stat Mech 2008:P10008","journal-title":"J Stat Mech"},{"key":"5749_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0378-8733(01)00038-7","volume":"23","author":"P Bonacich","year":"2001","unstructured":"Bonacich P, Lloyd P (2001) Eigenvector-like measures of centrality for asymmetric relations. Social Netw 23:191\u2013201","journal-title":"Social Netw"},{"key":"5749_CR5","doi-asserted-by":"publisher","first-page":"e0168125","DOI":"10.1371\/journal.pone.0168125","volume":"11","author":"PS Chakkingal","year":"2016","unstructured":"Chakkingal PS, Kumar SKN (2016) Learning from bees: an approach for influence maximization on viral campaigns. PLoS ONE 11:e0168125","journal-title":"PLoS ONE"},{"key":"5749_CR6","doi-asserted-by":"publisher","unstructured":"Chen W, Wang Y, Yang S Efficient influence maximization in social networks. In: Acm Sigkdd international conference on knowledge discovery and data mining, 2009. ACM, pp 199\u2013208. https:\/\/doi.org\/10.1145\/1557019.1557047.","DOI":"10.1145\/1557019.1557047"},{"key":"5749_CR7","doi-asserted-by":"publisher","unstructured":"David K, Jon K, \u00c9va T (2003) Maximizing the Spread of Influence through a Social Network. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 137\u2013146. https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"5749_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L Freeman","year":"1977","unstructured":"Freeman L (1977) A set of measures of centrality based on betweenness. Sociometry 40:35\u201341. https:\/\/doi.org\/10.2307\/3033543","journal-title":"Sociometry"},{"issue":"368","key":"5749_CR9","first-page":"600","volume":"367","author":"M Gong","year":"2016","unstructured":"Gong M, Yan J, Shen B, Lijia M, Cai Q (2016) Influence maximization in social networks based on discrete particle swarm optimization Information Ences An. Int J 367(368):600\u2013614","journal-title":"Int J"},{"key":"5749_CR10","volume-title":"Finding overlapping communities using disjoint community detection algorithms. Complex networks","author":"S Gregory","year":"2009","unstructured":"Gregory S (2009) Finding overlapping communities using disjoint community detection algorithms. Complex networks. Springer, Berlin"},{"key":"5749_CR11","doi-asserted-by":"publisher","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimer\u00e0","year":"2004","unstructured":"Guimer\u00e0 R, Danon L, Diaz-Guilera A, Giralt F (2004) Self-similar community structure in a network of human interactions. Phys Rev E Stat Nonliner Soft Matter Phys 68:065103","journal-title":"Phys Rev E Stat Nonliner Soft Matter Phys"},{"key":"5749_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.jpdc.2017.12.008","volume":"116","author":"M-Y Hsieh","year":"2018","unstructured":"Hsieh M-Y, Weng T-H, Li K-C (2018) A keyword-aware recommender system using implicit feedback on Hadoop. J Parallel Distrib Comput 116:63\u201373. https:\/\/doi.org\/10.1016\/j.jpdc.2017.12.008","journal-title":"J Parallel Distrib Comput"},{"key":"5749_CR13","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Gao C, Yu W, Xie K (2011) Simulated annealing based influence maximization in social networks. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence., San Francisco, California, USA. AAAI, pp 7\u201311","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"5749_CR14","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007a) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discovery Data 1:2","journal-title":"ACM Trans Knowl Discovery Data"},{"key":"5749_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C (2007b) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining., San Jose, California, USA, August 12\u201315.","DOI":"10.1145\/1281192.1281239"},{"key":"5749_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.jnca.2016.10.020","volume":"86","author":"F Lu","year":"2017","unstructured":"Lu F, Zhang W, Shao L, Jiang X, Xu P, Jin H (2017) Scalable influence maximization under independent cascade model. J Netw Comput Appl 86:15\u201323","journal-title":"J Netw Comput Appl"},{"key":"5749_CR17","doi-asserted-by":"crossref","unstructured":"Marek RO, Ogiela L (2017) Cognitive keys in personalized cryptography. Paper presented at the IEEE international conference on advanced information networking and applications (AINA 2017), Taipei, Taiwan","DOI":"10.1109\/AINA.2017.164"},{"key":"5749_CR18","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104. https:\/\/doi.org\/10.1103\/PhysRevE.74.036104","journal-title":"Phys Rev E"},{"issue":"5","key":"5749_CR19","doi-asserted-by":"publisher","first-page":"102260","DOI":"10.1016\/j.ipm.2020.102260","volume":"57","author":"L Ogiela","year":"2020","unstructured":"Ogiela L (2020) Transformative computing in advanced data analysis processes in the cloud. Inf Process Manag 57(5):102260","journal-title":"Inf Process Manag"},{"key":"5749_CR20","doi-asserted-by":"crossref","first-page":"e5316","DOI":"10.1002\/cpe.5316","volume":"32","author":"L Ogiela","year":"2020","unstructured":"Ogiela L, Marek RO (2020) Cognitive security paradigm for cloud computing applications. Concurr Comput Pract Exp 32:e5316","journal-title":"Concurr Comput Pract Exp"},{"key":"5749_CR21","doi-asserted-by":"publisher","first-page":"2451","DOI":"10.1007\/s00500-017-2546-2","volume":"21","author":"L Ogiela","year":"2017","unstructured":"Ogiela L, Takizawa M (2017) Personalized cryptography in cognitive management. Soft Comput 21:2451\u20132464","journal-title":"Soft Comput"},{"key":"5749_CR22","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2018.06.013","volume":"160","author":"J Tang","year":"2018","unstructured":"Tang J, Zhang R (2018) Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowl-Based Syst 160:88\u2013103","journal-title":"Knowl-Based Syst"},{"key":"5749_CR23","doi-asserted-by":"publisher","first-page":"104833.104831","DOI":"10.1016\/j.knosys.2019.07.004","volume":"187","author":"J Tang","year":"2020","unstructured":"Tang J, Zhang R, Wang P, Zhao Z, Fan L, Liu X (2020) A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowl Based Syst 187:104833.104831-104833.104812","journal-title":"Knowl Based Syst"},{"key":"5749_CR24","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.physa.2018.09.040","volume":"513","author":"J Tang","year":"2018","unstructured":"Tang J, Zhang R, Yao Y, Fan Y, Zhao Z, Hu R, Yuan Y (2018) Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization. Phys A Stat Mech Appl 513:477\u2013496","journal-title":"Phys A Stat Mech Appl"},{"key":"5749_CR25","first-page":"2063","volume":"16","author":"L Wei","year":"2019","unstructured":"Wei L, Kuan-Ching L, Jing L, Xiaoyan K, Zomaya AY (2019) An industrial network intrusion detection algorithm based on multifeature data clustering optimization model. IEEE Trans Ind Informatics 16:2063\u20132071","journal-title":"IEEE Trans Ind Informatics"},{"key":"5749_CR26","first-page":"1","volume":"99","author":"L Wei","year":"2020","unstructured":"Wei L, Yongkai F, Kuan-Ching L, Dafang Z, Jean-Luc G (2020) Secure data storage and recovery in industrial blockchain network environments. IEEE Trans Industr Inf 99:1\u20131","journal-title":"IEEE Trans Industr Inf"},{"issue":"7","key":"5749_CR27","doi-asserted-by":"publisher","first-page":"6392","DOI":"10.1109\/JIOT.2020.2974281","volume":"7","author":"W Liang","year":"2020","unstructured":"Liang W, Huang W, Long J, Li K-C, Zhang D (2020) Deep reinforcement learning for resource protection and real-time detection in loT environment. IEEE Internet Things J 7(7):6392\u20136401","journal-title":"IEEE Internet Things J"},{"key":"5749_CR28","doi-asserted-by":"publisher","DOI":"10.1080\/09540091.2020.1772722","author":"J Yan","year":"2020","unstructured":"Yan J, Wei L, Jintian T, Kuan-Ching L (2020) A novel data representation framework based on nonnegative manifold regularisation. Connect Sci. https:\/\/doi.org\/10.1080\/09540091.2020.1772722","journal-title":"Connect Sci"},{"key":"5749_CR29","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1007\/s11227-018-2419-1","volume":"76","author":"X Yang","year":"2018","unstructured":"Yang X, Zhou Q, Wang J, Zhou R, Li KC (2018) An energy-efficient dynamic decision model for wireless multi-sensor network. J Supercomput 76:1585\u20131603","journal-title":"J Supercomput"},{"key":"5749_CR30","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1504\/IJBIC.2011.042259","volume":"3","author":"XS Yang","year":"2012","unstructured":"Yang XS (2012) Bat algorithm for multi-objective optimisation. Int J Bio-Inspired Comput 3:267\u2013274","journal-title":"Int J Bio-Inspired Comput"},{"key":"5749_CR31","doi-asserted-by":"publisher","unstructured":"Zhang W, Han D, Li KC et al (2020) Wireless sensor network intrusion detection system based on MK-ELM[J]. Soft Comput 24(16):12361\u201312374. https:\/\/doi.org\/10.1007\/s00500-020-04678-1","DOI":"10.1007\/s00500-020-04678-1"},{"key":"5749_CR32","doi-asserted-by":"publisher","first-page":"102815","DOI":"10.1016\/j.jnca.2020.102815","volume":"170","author":"G Zhu","year":"2020","unstructured":"Zhu G, Pan Z, Wang Q, Zhang S, Li KC (2020) Building multi-subtopic Bi-level network for micro-blog hot topic based on feature Co-Occurrence and semantic community division. J Netw Comput Appl 170:102815","journal-title":"J Netw Comput Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05749-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05749-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05749-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T16:47:31Z","timestamp":1698857251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05749-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,4]]},"references-count":32,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["5749"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05749-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,4]]},"assertion":[{"value":"12 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflicts of interest regarding the publication of this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}