{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:30:37Z","timestamp":1787506237070,"version":"build-2736575974"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"9","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62172149"],"award-info":[{"award-number":["62172149"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100014472","name":"Scientific Research Foundation of Hunan Provincial Education Department","doi-asserted-by":"crossref","award":["24B0789"],"award-info":[{"award-number":["24B0789"]}],"id":[{"id":"10.13039\/100014472","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Changsha Natural Science Foundation","award":["kq2502339"],"award-info":[{"award-number":["kq2502339"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2025,11,30]]},"abstract":"<jats:p>\n                    In online social networks (OSNs), people usually join groups for communication. Information diffusion often occurs with some cost, either between individuals or within\/among groups; and different opinions may compete with each other. The groups can make decisions based on the majority of the group members. This type of group consensus is common in group activities. However, existing research on maximization of competitive influence often neglects the effects of group consensus. To this end, we introduce the process of group consensus reaching in influence maximization and propose a novel Group consensus-based Competitive Linear Threshold (GCLT) propagation model; then we study the Budgeted Competitive Influence Maximization (BCIM) problem under the GCLT model. We reveal that the problem is NP-hard, and the objective function is proven to be neither submodular nor supermodular. To this end, we construct an equivalent Group consensus-based Competitive Live-Edge (GCLE) model of GCLT by sampling method. Based on GCLE, develop two submodular functions of the upper and lower bounds. Then, we propose the\n                    <jats:sans-serif>SBG<\/jats:sans-serif>\n                    algorithm by applying the Sandwich Approximation framework for the BCIM problem under the GCLT model. In\n                    <jats:sans-serif>SBG<\/jats:sans-serif>\n                    , we provide an approximate solution to the lower bound and the upper bound by the proposed\n                    <jats:sans-serif>OPIM-B<\/jats:sans-serif>\n                    algorithm. Then, we select the seed set of solutions that achieves the best influence spread in Monte Carlo simulations. We also propose two strategies to optimize\n                    <jats:sans-serif>SBG<\/jats:sans-serif>\n                    . The experiments on six real social network datasets verify the effectiveness and scalability of our method and validate the impact of group consensus on the competitive influence dissemination process, as well as the importance of considering the process of reaching group consensus.\n                  <\/jats:p>","DOI":"10.1145\/3768583","type":"journal-article","created":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T18:43:52Z","timestamp":1758221032000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Integrating Group Consensus for Competitive Influence Maximization in OSNs"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9815-7641","authenticated-orcid":false,"given":"Guobang","family":"Chen","sequence":"first","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4985-7454","authenticated-orcid":false,"given":"Wenjun","family":"Jiang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2635-7716","authenticated-orcid":false,"given":"Kenli","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5638-9949","authenticated-orcid":false,"given":"Jingjing","family":"Wang","sequence":"additional","affiliation":[{"name":"Changsha University, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3472-1717","authenticated-orcid":false,"given":"Jie","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences, Temple University, Philadelphia, Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9315-4057","authenticated-orcid":false,"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,11,6]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.01.070"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.5555\/1781894.1781932"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397244"},{"key":"e_1_3_2_5_2","first-page":"946","volume-title":"25th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Borgs Christian","year":"2014","unstructured":"Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 946\u2013957."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.5555\/1940179.1940229"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.07.029"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/1963405.1963499","volume-title":"International Conference on World Wide Web","author":"Budak Ceren","year":"2011","unstructured":"Ceren Budak, Divyakant Agrawal, and Amr El Abbadi. 2011. Limiting the spread of misinformation in social networks. In International Conference on World Wide Web, 665\u2013674."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3316268"},{"key":"e_1_3_2_10_2","first-page":"351","volume-title":"International Conference on Electronic Commerce","author":"Carnes Tim","year":"2007","unstructured":"Tim Carnes, Chandrashekhar Nagarajan, Stefan M. Wild, and Anke Van Zuylen. 2007. Maximizing influence in a competitive social network: A follower\u2019s perspective. In International Conference on Electronic Commerce, 351\u2013360."},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3462759"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797315306"},{"key":"e_1_3_2_14_2","first-page":"999","volume-title":"2018 IEEE Ubiquitous Intelligence & Computing","author":"Dai Yajun","year":"2018","unstructured":"Yajun Dai, Wenjun Jiang, and Kenli Li. 2018. Group-based competitive influence maximization. In 2018 IEEE Ubiquitous Intelligence & Computing. IEEE, 999\u20131006."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1974.10480137"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-017-0305-x"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2024.3459853"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.06.002"},{"key":"e_1_3_2_19_2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/1963192.1963217","volume-title":"20th International Conference Companion on World Wide Web","author":"Goyal Amit","year":"2011","unstructured":"Amit Goyal, Wei Lu, and Laks V. S. Lakshmanan. 2011. Celf++ optimizing the greedy algorithm for influence maximization in social networks. In 20th International Conference Companion on World Wide Web, 47\u201348."},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.40"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2966593"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/0165-0114(86)90014-X"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3690644"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"e_1_3_2_28_2","first-page":"187","volume-title":"Performance Evaluation","author":"Lin Yishi","year":"2015","unstructured":"Yishi Lin and John C. S. Lui. 2015. Analyzing competitive influence maximization problems with partial information: An approximation algorithmic framework. Performance Evaluation 91 (2015), 187\u2013204. Special Issue: Performance 2015."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850581"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.145"},{"key":"e_1_3_2_31_2","first-page":"1932","volume-title":"IEEE Infocom","author":"Lu Zongqing","year":"2014","unstructured":"Zongqing Lu, Yonggang Wen, and Guohong Cao. 2014. Information diffusion in mobile social networks: The speed perspective. In IEEE Infocom, 1932\u20131940."},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3664618"},{"key":"e_1_3_2_33_2","volume-title":"1st International Conference on Learning Representations (ICLR \u201913)","author":"Mikolov Tom\u00e1s","year":"2013","unstructured":"Tom\u00e1s Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. In 1st International Conference on Learning Representations (ICLR \u201913). Yoshua Bengio and Yann LeCun (Eds.). Retrieved from http:\/\/arxiv.org\/abs\/1301.3781"},{"key":"e_1_3_2_34_2","unstructured":"Evgeny Morozov. 2009. Swine flu: Twitter\u2019s power to misinform. National Public Radio (2009). https:\/\/www.npr.org\/2009\/04\/28\/103562240\/swine-flu-twitters-power-to-misinform"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130610"},{"key":"e_1_3_2_36_2","volume-title":"The 2016 International Conference","author":"Nguyen H. T.","year":"2016","unstructured":"H. T. Nguyen, M. T. Thai, and T. N. Dinh. 2016. Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In The 2016 International Conference."},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2013.04.002"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2013.2262769"},{"issue":"3","key":"e_1_3_2_39_2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.ijintrel.2011.03.001","article-title":"Recent advances in intergroup contact theory","volume":"35","author":"Pettigrew Thomas F.","year":"2011","unstructured":"Thomas F. Pettigrew, Linda R. Tropp, Ulrich Wagner, and Oliver Christ. 2011. Recent advances in intergroup contact theory. International Journal of Intercultural Relations 35, 3 (2011), 271\u2013280.","journal-title":"International Journal of Intercultural Relations"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.3390\/app9112274"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3653711"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2320515"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183749"},{"key":"e_1_3_2_44_2","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1145\/2723372.2723734","volume-title":"2015 ACM SIGMOD International Conference on Management of Data","author":"Tang Youze","year":"2015","unstructured":"Youze Tang, Yanchen Shi, and Xiaokui Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In 2015 ACM SIGMOD International Conference on Management of Data, 1539\u20131554."},{"key":"e_1_3_2_45_2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/2588555.2593670","volume-title":"2014 ACM SIGMOD International Conference on Management of Data","author":"Tang Youze","year":"2014","unstructured":"Youze Tang, Xiaokui Xiao, and Yanchen Shi. 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In 2014 ACM SIGMOD International Conference on Management of Data, 75\u201386."},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3651987"},{"issue":"2","key":"e_1_3_2_47_2","doi-asserted-by":"crossref","first-page":"016114","DOI":"10.1103\/PhysRevE.84.016114","article-title":"Narrow scope for resolution-limit-free community detection","volume":"84","author":"Traag V. A.","year":"2011","unstructured":"V. A. Traag, Dooren P. Van, and Y. Nesterov. 2011. Narrow scope for resolution-limit-free community detection. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics 84, 2 (2011), 016114.","journal-title":"Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-023-09380-z"},{"key":"e_1_3_2_49_2","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1145\/1835804.1835935","volume-title":"ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Wang Yu","year":"2010","unstructured":"Yu Wang, Gao Cong, Guojie Song, and Kunqing Xie. 2010. Community-based greedy algorithm for mining top-K influential nodes in mobile social networks. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1039\u20131048."},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/3230871"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.14778\/3648160.3648171"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2024.130058"},{"key":"e_1_3_2_53_2","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/978-3-319-55753-3_39","volume-title":"Database Systems for Advanced Applications","author":"Yan Qian","year":"2017","unstructured":"Qian Yan, Hao Huang, Yunjun Gao, Wei Lu, and Qinming He. 2017. Group-level influence maximization with budget constraint. In Database Systems for Advanced Applications. Springer International Publishing, Cham, 625\u2013641."},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.138"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599267"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557076"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00228"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-66046-8_13"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2938575"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524472"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3768583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T13:11:12Z","timestamp":1762434672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3768583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,6]]},"references-count":59,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,11,30]]}},"alternative-id":["10.1145\/3768583"],"URL":"https:\/\/doi.org\/10.1145\/3768583","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,6]]},"assertion":[{"value":"2025-02-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}