{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:37Z","timestamp":1750219957960,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"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":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2023,4,26]]},"abstract":"<jats:p>We consider the problem of Influence Maximization (IM), the task of selecting k seed nodes in a social network such that the expected number of nodes influenced is maximized. We propose a community-aware divide-and-conquer framework that involves (i) learning the inherent community structure of the social network, (ii) generating candidate solutions by solving the influence maximization problem for each community, and (iii) selecting the final set of seed nodes using a novel progressive budgeting scheme.<\/jats:p>\n          <jats:p>Our experiments on a real-world social network show that the proposed framework outperforms the standard methods in terms of run-time and the heuristic methods in terms of influence.<\/jats:p>","DOI":"10.1145\/3595244.3595251","type":"journal-article","created":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T10:27:14Z","timestamp":1682591234000},"page":"17-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Leveraging the Community Structure of a Social Network for Maximizing the Spread of Influence"],"prefix":"10.1145","volume":"50","author":[{"given":"Abhishek K.","family":"Umrawal","sequence":"first","affiliation":[{"name":"Purdue University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaneet","family":"Aggarwal","sequence":"additional","affiliation":[{"name":"Purdue University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,4,27]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Stochastic top-k subset bandits with linear space and non-linear feedback with applications to social influence maximization. ACM\/IMS Trans. on Data Sci. (TDS), 2(4):1--39","author":"Agarwal M.","year":"2022","unstructured":"M. Agarwal , V. Aggarwal , A. K. Umrawal , and C. J. Quinn . Stochastic top-k subset bandits with linear space and non-linear feedback with applications to social influence maximization. ACM\/IMS Trans. on Data Sci. (TDS), 2(4):1--39 , 2022 . M. Agarwal, V. Aggarwal, A. K. Umrawal, and C. J. Quinn. Stochastic top-k subset bandits with linear space and non-linear feedback with applications to social influence maximization. ACM\/IMS Trans. on Data Sci. (TDS), 2(4):1--39, 2022."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"issue":"3","key":"e_1_2_1_4_1","first-page":"211","article-title":"Talk network: A complex systems look at the underlying process of word-of-mouth","volume":"12","author":"Goldenberg J.","year":"2001","unstructured":"J. Goldenberg , B. Libai , and E. Muller . Talk network: A complex systems look at the underlying process of word-of-mouth . Mktg. letters , 12 ( 3 ): 211 -- 223 , 2001 . J. Goldenberg, B. Libai, and E. Muller. Talk network: A complex systems look at the underlying process of word-of-mouth. Mktg. letters, 12(3):211--223, 2001.","journal-title":"Mktg. letters"},{"issue":"3","key":"e_1_2_1_5_1","first-page":"1","article-title":"Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata","volume":"9","author":"Goldenberg J.","year":"2001","unstructured":"J. Goldenberg , B. Libai , and E. Muller . Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata . Acad. of Mktg. Sci. Rev. , 9 ( 3 ): 1 -- 18 , 2001 . J. Goldenberg, B. Libai, and E. Muller. Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad. of Mktg. Sci. Rev., 9(3):1--18, 2001.","journal-title":"Acad. of Mktg. Sci. Rev."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1086\/226707"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_10_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_2_1_11_1","volume-title":"The 38th Conf. on Uncertainty in AI","author":"Nie G.","year":"2022","unstructured":"G. Nie , M. Agarwal , A. K. Umrawal , V. Aggarwal , and C. J. Quinn . An explore-then-commit algorithm for submodular maximization under full-bandit feedback . In The 38th Conf. on Uncertainty in AI , 2022 . G. Nie, M. Agarwal, A. K. Umrawal, V. Aggarwal, and C. J. Quinn. An explore-then-commit algorithm for submodular maximization under full-bandit feedback. In The 38th Conf. on Uncertainty in AI, 2022."},{"key":"e_1_2_1_12_1","volume-title":"Micromotives and macrobehavior","author":"Schelling T. C.","year":"2006","unstructured":"T. C. Schelling . Micromotives and macrobehavior . WW Norton & Company , 2006 . T. C. Schelling. Micromotives and macrobehavior. WW Norton & Company, 2006."},{"key":"e_1_2_1_13_1","volume-title":"Cofim: A community-based framework for influence maximization on large-scale networks. Know.-based systems, 117:88--100","author":"Shang J.","year":"2017","unstructured":"J. Shang , S. Zhou , X. Li , L. Liu , and H. Wu . Cofim: A community-based framework for influence maximization on large-scale networks. Know.-based systems, 117:88--100 , 2017 . J. Shang, S. Zhou, X. Li, L. Liu, and H. Wu. Cofim: A community-based framework for influence maximization on large-scale networks. Know.-based systems, 117:88--100, 2017."},{"key":"e_1_2_1_14_1","volume-title":"A community-aware framework for social influence maximization. arXiv preprint","author":"Umrawal A. K.","year":"2022","unstructured":"A. K. Umrawal , C. J. Quinn , and V. Aggarwal . A community-aware framework for social influence maximization. arXiv preprint , 2022 . A. K. Umrawal, C. J. Quinn, and V. Aggarwal. A community-aware framework for social influence maximization. arXiv preprint, 2022."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3595244.3595251","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3595244.3595251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:08Z","timestamp":1750182548000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3595244.3595251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4,26]]}},"alternative-id":["10.1145\/3595244.3595251"],"URL":"https:\/\/doi.org\/10.1145\/3595244.3595251","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"2023-04-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}