{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T13:48:59Z","timestamp":1780321739732,"version":"3.54.1"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T00:00:00Z","timestamp":1728345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Web"],"published-print":{"date-parts":[[2024,11,30]]},"abstract":"<jats:p>Online social networks are crucial in propagating information and exerting influence through word-of-mouth transmission. Influence maximization (IM) is the fundamental task in social network analysis to find the group of nodes that maximizes the influence in the social network. IM has different applications like viral marketing, campaigning, advertising, and so on. Literature has presented various algorithms based on different approaches to address the IM problem, including nature-inspired algorithms. Most of the work focuses on the static social network. The proposed work first employs nature-inspired Cuckoo Search Optimization to solve the IM problem in dynamic networks. The proposed algorithm applies the fuzzy-logic-based technique to optimize the nests. We also perform statistical tests to show the effectiveness of the proposed algorithm with the benchmark algorithms. The experimental results are performed on five datasets and compare the results with the state-of-the-art algorithms. The results show that the proposed algorithm gives better results than the nature-inspired state-of-the-art algorithms.<\/jats:p>","DOI":"10.1145\/3690644","type":"journal-article","created":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T10:26:31Z","timestamp":1724840791000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Cuckoo Search Optimization-Based Influence Maximization in Dynamic Social Networks"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7623-7712","authenticated-orcid":false,"given":"Sunil","family":"Kumar Meena","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Delhi, New Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0909-2258","authenticated-orcid":false,"given":"Shashank","family":"Sheshar Singh","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering Department, Thapar Institute of Engineering and Technology (Deemed to be University), Patiala, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5289-362X","authenticated-orcid":false,"given":"Kuldeep","family":"Singh","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Delhi, New Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,10,8]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/1134271.1134277"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488522400220"},{"issue":"3","key":"e_1_3_2_4_2","first-page":"16","article-title":"Influence maximization in complex social networks based on community structure","volume":"13","author":"Amiri Babak","year":"2021","unstructured":"Babak Amiri, Mohammad Fathian, and Elnaz Asaadi. 2021. Influence maximization in complex social networks based on community structure. Journal of Industrial and Systems Engineering 13, 3 (2021), 16\u201340. arXiv:https:\/\/www.jise.ir\/article_128461_a5fb2d5a6affa0c9637da437d643ba6d.pdfhttps:\/\/www.jise.ir\/article_128461.html","journal-title":"Journal of Industrial and Systems Engineering"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035924"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-019-01286-2"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100393"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1080\/08839514.2014.904599"},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/1.9781611973402.70","article-title":"Maximizing social influence in nearly optimal time","author":"Borgs Christian","year":"2014","unstructured":"Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201914), Society for Industrial, Portland, Oregon, 946\u2013957.","journal-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201914)"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7163-9_383-1"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101102"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01850-3"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505541"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1937.10503522"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/C2012-0-00171-8"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.07.012"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.matpr.2017.07.055"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02283-9"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-019-01506-4"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-003-0651-y"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105606"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aci.2017.09.001"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3664618"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114493"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119174"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0033799"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0091431"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994525"},{"key":"e_1_3_2_38_2","volume-title":"The PageRank Citation Ranking: Bringing Order to the Web.","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web.Technical Report 1999-66. Stanford InfoLab. http:\/\/ilpubs.stanford.edu:8090\/422\/. Previous number = SIDL-WP-1999-0120."},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.12.027"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100614"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106436"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2019.2931272"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.04.084"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105554"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5421"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.11.026"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3648470"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-04533-y"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2021.08.009"},{"key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/978-81-322-2529-4_5","volume-title":"Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics.","author":"Sinha Nikita","year":"2016","unstructured":"Nikita Sinha and B. Annappa. 2016. Cuckoo search for influence maximization in social networks. In Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics.Atulya Nagar, Durga Prasad Mohapatra, and Nabendu Chaki (Eds.), Springer India, New Delhi, 51\u201361."},{"key":"e_1_3_2_51_2","volume-title":"Social Network Analysis","author":"T Chakraborty","year":"2021","unstructured":"Chakraborty T. 2021. Social Network Analysis. Wiley India Pvt. Ltd."},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.07.004"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.06.013"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0262-1"},{"issue":"8","key":"e_1_3_2_56_2","first-page":"1","article-title":"A multi-objective crow search algorithm for influence maximization in social networks","volume":"12","author":"Wang Ping","year":"2023","unstructured":"Ping Wang and Ruisheng Zhang. 2023. A multi-objective crow search algorithm for influence maximization in social networks. Electronics 12, 8 (2023), 1\u201321. Retrieved from https:\/\/www.mdpi.com\/2079-9292\/12\/8\/1790","journal-title":"Electronics"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/2594454"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1367-1"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112971"},{"key":"e_1_3_2_62_2","first-page":"1","article-title":"Dynamic top-k influence maximization in social networks","author":"Zhang Binbin","year":"2020","unstructured":"Binbin Zhang, Hao Wang, and Leong Hou U. 2020. Dynamic top-k influence maximization in social networks. GeoInformatica (2020), 1\u201324.","journal-title":"GeoInformatica"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3189036"}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690644","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:06Z","timestamp":1750294686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,8]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,11,30]]}},"alternative-id":["10.1145\/3690644"],"URL":"https:\/\/doi.org\/10.1145\/3690644","relation":{},"ISSN":["1559-1131","1559-114X"],"issn-type":[{"value":"1559-1131","type":"print"},{"value":"1559-114X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,8]]},"assertion":[{"value":"2023-12-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}