{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T13:48:46Z","timestamp":1780321726749,"version":"3.54.1"},"reference-count":65,"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>\n            Influence maximization (IM) is the fundamental study of social network analysis. The IM problem finds the top\n            <jats:italic>k<\/jats:italic>\n            nodes that have maximum influence in the network. Most of the studies in IM focus on maximizing the number of activated nodes in the static social network. But in real life, social networks are dynamic in nature. This work addresses the diversification of activated nodes in the dynamic social network. This work proposes an objective function that maximizes the number of communities by utilizing bridge nodes. We also propose a diffusion model that considers the role of inactive nodes in influencing a node. We prove the submodularity, and monotonicity of the objective function under the proposed diffusion model. This work analyzes the impact of different ratios of bridge nodes in the seed set on real-world and synthetic datasets. Furthermore, we prove the NP-Hardness of the objective function under the proposed diffusion model. The experiments are conducted on various real-world and synthetic datasets with known and unknown community information. The proposed work experimentally shows that the objective function gives the maximum number of communities considering bridge nodes compared with the benchmark algorithms.\n          <\/jats:p>","DOI":"10.1145\/3664618","type":"journal-article","created":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T11:28:56Z","timestamp":1715426936000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["DCDIMB: Dynamic Community-based Diversified Influence Maximization using Bridge Nodes"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7623-7712","authenticated-orcid":false,"given":"Sunil Kumar","family":"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 Sheshar","family":"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.1287\/mnsc.1110.1421"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1080\/00224545.1940.9921487"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-62005-9_11"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124368"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature11421"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118869"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2021.126841"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735706"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01850-3"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00935-x"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2532549"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662077"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1101\/2020.05.06.20092734"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3022096"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","unstructured":"Aaryan Gupta Inder Khatri Arjun Choudhry Pranav Chandhok Dinesh Kumar Vishwakarma and Mukesh Prasad. 2022. A Spreader Ranking Algorithm for Extremely Low-budget Influence Maximization in Social Networks using Community Bridge Nodes. 10.48550\/arXiv.2211.09657","DOI":"10.48550\/arXiv.2211.09657"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-023-00776-2"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2023.3259726"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/1837885.1837906"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/IKT57960.2022.10039040"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0092-8240(05)80040-0"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544831"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00996-y"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijproman.2016.10.007"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101522"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2022.127721"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.158"},{"issue":"14","key":"e_1_3_2_36_2","first-page":"5659","article-title":"A new community-based algorithm for influence maximization in social network","volume":"9","author":"Lv Jiaguo","year":"2013","unstructured":"Jiaguo Lv, Jingfeng Guo, and Huixiao Ren. 2013. A new community-based algorithm for influence maximization in social network. Journal of Computational Information Systems 9, 14 (2013), 5659\u20135666. Retrieved from https:\/\/citeseerx.ist.psu.edu\/document?repid=rep1&type=pdf&doi=e447f714a6c0e6396c335cd48339e0ca3376919f","journal-title":"Journal of Computational Information Systems"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-020-00792-0"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114493"},{"key":"e_1_3_2_39_2","unstructured":"Newman. 2006. Structure of internet routers as of July 22 2006. Retrieved from https:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Newman\/as-22july06.html. https:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Newman\/as-22july06.html"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.016131"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.74.036104"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0091431"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"e_1_3_2_44_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. Retrieved from http:\/\/ilpubs.stanford.edu:8090\/422\/Previous number = SIDL-WP-1999-0120."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.04.084"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.09.142"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105554"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.04.138"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-04533-y"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2021.08.009"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2014.6734935"},{"key":"e_1_3_2_52_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_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"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.26599\/BDMA.2021.9020024"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","unstructured":"Alan Tsang Bryan Wilder Eric Rice Milind Tambe and Yair Zick. 2019. Group-fairness in influence maximization. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI\u201919). International Joint Conferences on Artificial Intelligence Organization 5997\u20136005. 10.24963\/ijcai.2019\/831","DOI":"10.24963\/ijcai.2019\/831"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0262-1"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841707"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1098\/rstb.1986.0056"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcps.2012.05.003"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/3409370"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107497"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/2594454"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-020-00419-6"}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664618","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3664618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:45Z","timestamp":1750291425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,8]]},"references-count":65,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,11,30]]}},"alternative-id":["10.1145\/3664618"],"URL":"https:\/\/doi.org\/10.1145\/3664618","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-08-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-28","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"}}]}}