{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:53:25Z","timestamp":1764784405102,"version":"3.41.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T00:00:00Z","timestamp":1584057600000},"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. Knowl. Discov. Data"],"published-print":{"date-parts":[[2020,6,30]]},"abstract":"<jats:p>Imagine we are introducing a new product through a social network, where we know for each user in the network the function of purchase probability with respect to discount. Then, what discounts should we offer to those social network users so that, under a predefined budget, the adoption of the product is maximized in expectation? Although influence maximization has been extensively explored, this appealing practical problem still cannot be answered by the existing influence maximization methods. In this article, we tackle the problem systematically. We formulate the general continuous influence maximization problem, investigate the essential properties, and develop a general coordinate descent algorithmic framework as well as the engineering techniques for practical implementation. Our investigation does not assume any specific influence model and thus is general and principled. At the same time, using the most popularly adopted triggering model as a concrete example, we demonstrate that more efficient methods are feasible under specific influence models. Our extensive empirical study on four benchmark real-world networks with synthesized purchase probability curves clearly illustrates that continuous influence maximization can improve influence spread significantly with very moderate extra running time comparing to the classical influence maximization methods.<\/jats:p>","DOI":"10.1145\/3380928","type":"journal-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T14:48:38Z","timestamp":1584110918000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Continuous Influence Maximization"],"prefix":"10.1145","volume":"14","author":[{"given":"Yu","family":"Yang","sequence":"first","affiliation":[{"name":"City University of Hong Kong, Kowloon, Hong Kong, China"}]},{"given":"Xiangbo","family":"Mao","sequence":"additional","affiliation":[{"name":"Simon Fraser University 8 Zhejiang University, Burnaby, Canada"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, Canada"}]},{"given":"Xiaofei","family":"He","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, Zhejiang, China"}]}],"member":"320","published-online":{"date-parts":[[2020,3,13]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization. CUP.  Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization. CUP.","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_2_1_3_1","first-page":"51","article-title":"Constructing demand curves from purchase probability data: An application of the juster scale","author":"Brennan Mike","year":"1995","unstructured":"Mike Brennan . 1995 . Constructing demand curves from purchase probability data: An application of the juster scale . Marketing Bulletin 6 , May (1995), 51 -- 58 . Mike Brennan. 1995. Constructing demand curves from purchase probability data: An application of the juster scale. Marketing Bulletin 6, May (1995), 51--58.","journal-title":"Marketing Bulletin 6"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2601921"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2004.10.015"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797315306"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568039"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 26th International Conference on Neural Information Processing Systems. 3147--3155","author":"Du Nan","year":"2013","unstructured":"Nan Du , Le Song , Manuel Gomez-Rodriguez , and Hongyuan Zha . 2013 . Scalable influence estimation in continuous-time diffusion networks . In Proceedings of the 26th International Conference on Neural Information Processing Systems. 3147--3155 . Nan Du, Le Song, Manuel Gomez-Rodriguez, and Hongyuan Zha. 2013. Scalable influence estimation in continuous-time diffusion networks. In Proceedings of the 26th International Conference on Neural Information Processing Systems. 3147--3155."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487683"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 27th International Conference on Neural Information Processing Systems. ACM, 2474\u20132482","author":"Farajtabar Mehrdad","year":"2014","unstructured":"Mehrdad Farajtabar , Nan Du , Manuel Gomez-Rodriguez , Isabel Valera , Hongyuan Zha , and Le Song . 2014 . Shaping social activity by incentivizing users . In Proceedings of the 27th International Conference on Neural Information Processing Systems. ACM, 2474\u20132482 . Mehrdad Farajtabar, Nan Du, Manuel Gomez-Rodriguez, Isabel Valera, Hongyuan Zha, and Le Song. 2014. Shaping social activity by incentivizing users. In Proceedings of the 27th International Conference on Neural Information Processing Systems. ACM, 2474\u20132482."},{"volume-title":"Proceedings of the IEEE 11th International Conference on Data Mining. IEEE, 211--220","author":"Goyal Amit","key":"e_1_2_1_15_1","unstructured":"Amit Goyal , Wei Lu , and Laks V. S. Lakshmanan . 2011. Simpath: An efficient algorithm for influence maximization under the linear threshold model . In Proceedings of the IEEE 11th International Conference on Data Mining. IEEE, 211--220 . Amit Goyal, Wei Lu, and Laks V. S. Lakshmanan. 2011. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In Proceedings of the IEEE 11th International Conference on Data Mining. IEEE, 211--220."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099623"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a004"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.13.4.351"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783271"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.16"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662009"},{"key":"e_1_2_1_24_1","volume-title":"Enhong Chen, Hui Xiong, Yi Zheng, and Yu Yang.","author":"Liu Qi","year":"2017","unstructured":"Qi Liu , Biao Xiang , Nicholas Jing Yuan , Enhong Chen, Hui Xiong, Yi Zheng, and Yu Yang. 2017 . An influence propagation view of pagerank. ACM Transactions on Knowledge Discovery from Data 11, 3 (2017), 30. Qi Liu, Biao Xiang, Nicholas Jing Yuan, Enhong Chen, Hui Xiong, Yi Zheng, and Yu Yang. 2017. An influence propagation view of pagerank. ACM Transactions on Knowledge Discovery from Data 11, 3 (2017), 30."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.99"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. CUP.  Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. CUP.","DOI":"10.1017\/CBO9780511813603"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250811"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/3041100.3041113"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130610"},{"volume-title":"Proceedings of the 2016 International Conference on Management of Data. ACM, 695--710","author":"Nguyen Hung T.","key":"e_1_2_1_30_1","unstructured":"Hung T. Nguyen , My T. Thai , and Thang N. Dinh . 2016. Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks . In Proceedings of the 2016 International Conference on Management of Data. ACM, 695--710 . Hung T. Nguyen, My T. Thai, and Thang N. Dinh. 2016. Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In Proceedings of the 2016 International Conference on Management of Data. ACM, 695--710."},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Shai Shalev-Shwartz and Shai Ben-David. 2014. Understanding Machine Learning: From Theory to Algorithms. CUP.  Shai Shalev-Shwartz and Shai Ben-David. 2014. Understanding Machine Learning: From Theory to Algorithms. CUP.","DOI":"10.1017\/CBO9781107298019"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124381"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2004.01.008"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_2_1_37_1","unstructured":"Gaebler Ventures. 2013. Business Advertising. Retrieved from http:\/\/www.gaebler.com\/Business-Advertising.htm.  Gaebler Ventures. 2013. Business Advertising. Retrieved from http:\/\/www.gaebler.com\/Business-Advertising.htm."},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11432-013-4895-5","article-title":"Influence maximization with limit cost in social network","volume":"56","author":"Wang Yue","year":"2013","unstructured":"Yue Wang , WeiJing Huang , Lang Zong , TengJiao Wang , and DongQing Yang . 2013 . Influence maximization with limit cost in social network . Science China Information Sciences 56 , 7 (2013), 1 -- 14 . Yue Wang, WeiJing Huang, Lang Zong, TengJiao Wang, and DongQing Yang. 2013. Influence maximization with limit cost in social network. Science China Information Sciences 56, 7 (2013), 1--14.","journal-title":"Science China Information Sciences"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 24th International Joint Conference on Artificial Intelligence. ACM, 2104\u20132110","author":"Wang Zhefeng","year":"2015","unstructured":"Zhefeng Wang , Enhong Chen , Qi Liu , Yu Yang , Yong Ge , and Biao Chang . 2015 . Maximizing the coverage of information propagation in social networks . In Proceedings of the 24th International Joint Conference on Artificial Intelligence. ACM, 2104\u20132110 . Zhefeng Wang, Enhong Chen, Qi Liu, Yu Yang, Yong Ge, and Biao Chang. 2015. Maximizing the coverage of information propagation in social networks. In Proceedings of the 24th International Joint Conference on Artificial Intelligence. ACM, 2104\u20132110."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882961"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3084041.3084043"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3380928","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3380928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:46Z","timestamp":1750199566000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3380928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,13]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6,30]]}},"alternative-id":["10.1145\/3380928"],"URL":"https:\/\/doi.org\/10.1145\/3380928","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2020,3,13]]},"assertion":[{"value":"2018-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}